./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-symm.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/chl-chromosome-symm.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 23ca06a4d1d66eab783b29fc3ce31114eee62eb7d17a2452b84e2d73b8d92cfa --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:19:24,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:19:24,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:19:24,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:19:24,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:19:24,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:19:24,792 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:19:24,792 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:19:24,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:19:24,793 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:19:24,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:19:24,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:19:24,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:19:24,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:19:24,794 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:19:24,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:19:24,794 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:19:24,794 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:19:24,794 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:19:24,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:19:24,795 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:19:24,795 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:19:24,795 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:19:24,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:19:24,795 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:19:24,795 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:19:24,795 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:19:24,795 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:19:24,795 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:19:24,795 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:19:24,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:19:24,796 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:19:24,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:19:24,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:19:24,796 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:19:24,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:19:24,796 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:19:24,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:19:24,797 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:19:24,797 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:19:24,797 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:19:24,797 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:19:24,797 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 -> 23ca06a4d1d66eab783b29fc3ce31114eee62eb7d17a2452b84e2d73b8d92cfa [2025-03-09 01:19:24,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:19:24,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:19:24,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:19:24,994 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:19:24,995 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:19:24,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c [2025-03-09 01:19:26,089 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/075173863/e30e43edc8a24f338ffe636ca30d92b5/FLAGc22a4620e [2025-03-09 01:19:26,301 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:19:26,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c [2025-03-09 01:19:26,309 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/075173863/e30e43edc8a24f338ffe636ca30d92b5/FLAGc22a4620e [2025-03-09 01:19:26,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/075173863/e30e43edc8a24f338ffe636ca30d92b5 [2025-03-09 01:19:26,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:19:26,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:19:26,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:19:26,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:19:26,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:19:26,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:19:26" (1/1) ... [2025-03-09 01:19:26,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71df0c95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:26, skipping insertion in model container [2025-03-09 01:19:26,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:19:26" (1/1) ... [2025-03-09 01:19:26,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:19:26,789 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:19:26,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:19:26,800 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:19:26,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:19:26,827 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:19:26,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:26 WrapperNode [2025-03-09 01:19:26,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:19:26,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:19:26,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:19:26,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:19:26,832 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:19:26" (1/1) ... [2025-03-09 01:19:26,836 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:19:26" (1/1) ... [2025-03-09 01:19:26,852 INFO L138 Inliner]: procedures = 24, calls = 28, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 181 [2025-03-09 01:19:26,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:19:26,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:19:26,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:19:26,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:19:26,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:26" (1/1) ... [2025-03-09 01:19:26,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:26" (1/1) ... [2025-03-09 01:19:26,867 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:26" (1/1) ... [2025-03-09 01:19:26,882 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-09 01:19:26,883 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:26" (1/1) ... [2025-03-09 01:19:26,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:26" (1/1) ... [2025-03-09 01:19:26,892 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:26" (1/1) ... [2025-03-09 01:19:26,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:26" (1/1) ... [2025-03-09 01:19:26,896 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:26" (1/1) ... [2025-03-09 01:19:26,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:26" (1/1) ... [2025-03-09 01:19:26,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:19:26,898 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:19:26,898 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:19:26,898 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:19:26,899 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:26" (1/1) ... [2025-03-09 01:19:26,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:19:26,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:26,924 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:19:26,926 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:19:26,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:19:26,942 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:19:26,942 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:19:26,942 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:19:26,942 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:19:26,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:19:26,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:19:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:19:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:19:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:19:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:19:26,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:19:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:19:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:19:26,944 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:19:27,008 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:19:27,009 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:19:27,281 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:19:27,282 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:19:27,506 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:19:27,506 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:19:27,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:19:27 BoogieIcfgContainer [2025-03-09 01:19:27,507 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:19:27,509 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:19:27,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:19:27,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:19:27,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:19:26" (1/3) ... [2025-03-09 01:19:27,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414f0f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:19:27, skipping insertion in model container [2025-03-09 01:19:27,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:26" (2/3) ... [2025-03-09 01:19:27,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414f0f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:19:27, skipping insertion in model container [2025-03-09 01:19:27,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:19:27" (3/3) ... [2025-03-09 01:19:27,515 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-symm.wvr.c [2025-03-09 01:19:27,526 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:19:27,527 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-symm.wvr.c that has 3 procedures, 39 locations, 1 initial locations, 4 loop locations, and 14 error locations. [2025-03-09 01:19:27,527 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:19:27,573 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:19:27,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 42 transitions, 98 flow [2025-03-09 01:19:27,622 INFO L124 PetriNetUnfolderBase]: 4/40 cut-off events. [2025-03-09 01:19:27,625 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:19:27,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 40 events. 4/40 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 87 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-03-09 01:19:27,631 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 42 transitions, 98 flow [2025-03-09 01:19:27,634 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 39 transitions, 90 flow [2025-03-09 01:19:27,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:19:27,649 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;@579f4918, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:19:27,650 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-09 01:19:27,652 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:19:27,653 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:19:27,653 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:19:27,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:27,654 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:19:27,654 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:19:27,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:27,658 INFO L85 PathProgramCache]: Analyzing trace with hash 551281, now seen corresponding path program 1 times [2025-03-09 01:19:27,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:27,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480024475] [2025-03-09 01:19:27,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:27,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:27,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:19:27,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:19:27,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:27,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:27,826 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:19:27,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:27,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480024475] [2025-03-09 01:19:27,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480024475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:27,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:27,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:19:27,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949945191] [2025-03-09 01:19:27,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:27,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:19:27,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:27,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:19:27,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:19:27,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-03-09 01:19:27,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:27,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:27,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-03-09 01:19:27,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:27,946 INFO L124 PetriNetUnfolderBase]: 39/118 cut-off events. [2025-03-09 01:19:27,946 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-09 01:19:27,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 118 events. 39/118 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 429 event pairs, 22 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 162. Up to 68 conditions per place. [2025-03-09 01:19:27,948 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 18 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2025-03-09 01:19:27,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 122 flow [2025-03-09 01:19:27,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:19:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:19:27,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-03-09 01:19:27,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-03-09 01:19:27,962 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 90 flow. Second operand 3 states and 77 transitions. [2025-03-09 01:19:27,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 122 flow [2025-03-09 01:19:27,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 35 transitions, 114 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:19:27,967 INFO L231 Difference]: Finished difference. Result has 36 places, 35 transitions, 78 flow [2025-03-09 01:19:27,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=36, PETRI_TRANSITIONS=35} [2025-03-09 01:19:27,971 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -6 predicate places. [2025-03-09 01:19:27,972 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 35 transitions, 78 flow [2025-03-09 01:19:27,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:27,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:27,972 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:19:27,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:19:27,973 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:19:27,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:27,973 INFO L85 PathProgramCache]: Analyzing trace with hash 551282, now seen corresponding path program 1 times [2025-03-09 01:19:27,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:27,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905945154] [2025-03-09 01:19:27,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:27,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:27,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:19:27,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:19:27,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:27,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:28,138 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:19:28,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:28,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905945154] [2025-03-09 01:19:28,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905945154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:28,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:28,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:19:28,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617460173] [2025-03-09 01:19:28,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:28,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:28,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:28,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:28,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:28,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-03-09 01:19:28,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:19:28,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:28,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-03-09 01:19:28,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:28,291 INFO L124 PetriNetUnfolderBase]: 39/122 cut-off events. [2025-03-09 01:19:28,291 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:19:28,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 122 events. 39/122 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 425 event pairs, 22 based on Foata normal form. 1/96 useless extension candidates. Maximal degree in co-relation 179. Up to 76 conditions per place. [2025-03-09 01:19:28,293 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 22 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2025-03-09 01:19:28,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 138 flow [2025-03-09 01:19:28,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:19:28,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:19:28,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-03-09 01:19:28,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-09 01:19:28,294 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 78 flow. Second operand 3 states and 84 transitions. [2025-03-09 01:19:28,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 138 flow [2025-03-09 01:19:28,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:19:28,297 INFO L231 Difference]: Finished difference. Result has 37 places, 37 transitions, 100 flow [2025-03-09 01:19:28,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=37} [2025-03-09 01:19:28,298 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -5 predicate places. [2025-03-09 01:19:28,298 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 37 transitions, 100 flow [2025-03-09 01:19:28,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:19:28,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:28,298 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:19:28,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:19:28,298 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:19:28,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:28,299 INFO L85 PathProgramCache]: Analyzing trace with hash 529799929, now seen corresponding path program 1 times [2025-03-09 01:19:28,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:28,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501673550] [2025-03-09 01:19:28,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:28,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:28,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:19:28,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:19:28,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:28,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:28,484 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:19:28,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:28,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501673550] [2025-03-09 01:19:28,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501673550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:28,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016627802] [2025-03-09 01:19:28,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:28,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:28,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:28,488 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:19:28,490 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:19:28,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:19:28,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:19:28,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:28,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:28,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:19:28,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:28,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:19:28,619 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:19:28,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:28,682 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:19:28,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016627802] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:28,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:28,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2025-03-09 01:19:28,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956088334] [2025-03-09 01:19:28,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:28,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:19:28,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:28,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:19:28,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:19:28,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-03-09 01:19:28,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 100 flow. Second operand has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:28,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:28,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-03-09 01:19:28,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:28,895 INFO L124 PetriNetUnfolderBase]: 43/138 cut-off events. [2025-03-09 01:19:28,896 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:19:28,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 138 events. 43/138 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 473 event pairs, 22 based on Foata normal form. 2/114 useless extension candidates. Maximal degree in co-relation 211. Up to 78 conditions per place. [2025-03-09 01:19:28,897 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 28 selfloop transitions, 14 changer transitions 0/55 dead transitions. [2025-03-09 01:19:28,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 242 flow [2025-03-09 01:19:28,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:19:28,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:19:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2025-03-09 01:19:28,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.626984126984127 [2025-03-09 01:19:28,898 INFO L175 Difference]: Start difference. First operand has 37 places, 37 transitions, 100 flow. Second operand 6 states and 158 transitions. [2025-03-09 01:19:28,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 242 flow [2025-03-09 01:19:28,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:19:28,900 INFO L231 Difference]: Finished difference. Result has 44 places, 47 transitions, 198 flow [2025-03-09 01:19:28,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=198, PETRI_PLACES=44, PETRI_TRANSITIONS=47} [2025-03-09 01:19:28,900 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2025-03-09 01:19:28,901 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 47 transitions, 198 flow [2025-03-09 01:19:28,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.666666666666668) internal successors, (177), 9 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:28,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:28,901 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-09 01:19:28,907 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:19:29,105 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:19:29,105 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:19:29,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:29,105 INFO L85 PathProgramCache]: Analyzing trace with hash -765506290, now seen corresponding path program 2 times [2025-03-09 01:19:29,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:29,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486438174] [2025-03-09 01:19:29,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:29,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:29,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 01:19:29,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:19:29,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:19:29,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:29,372 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:29,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:29,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486438174] [2025-03-09 01:19:29,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486438174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:29,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713739530] [2025-03-09 01:19:29,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:29,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:29,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:29,375 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:19:29,376 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:19:29,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 01:19:29,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:19:29,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:19:29,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:29,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:19:29,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:29,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:19:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:29,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:29,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713739530] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:29,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:29,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-03-09 01:19:29,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639941905] [2025-03-09 01:19:29,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:29,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:19:29,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:29,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:19:29,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:19:29,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-03-09 01:19:29,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 47 transitions, 198 flow. Second operand has 18 states, 18 states have (on average 19.833333333333332) internal successors, (357), 18 states have internal predecessors, (357), 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:19:29,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:29,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-03-09 01:19:29,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:30,221 INFO L124 PetriNetUnfolderBase]: 39/136 cut-off events. [2025-03-09 01:19:30,221 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-09 01:19:30,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 136 events. 39/136 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 422 event pairs, 22 based on Foata normal form. 10/122 useless extension candidates. Maximal degree in co-relation 209. Up to 68 conditions per place. [2025-03-09 01:19:30,222 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 23 selfloop transitions, 17 changer transitions 0/53 dead transitions. [2025-03-09 01:19:30,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 262 flow [2025-03-09 01:19:30,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:19:30,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:19:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 212 transitions. [2025-03-09 01:19:30,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5608465608465608 [2025-03-09 01:19:30,223 INFO L175 Difference]: Start difference. First operand has 44 places, 47 transitions, 198 flow. Second operand 9 states and 212 transitions. [2025-03-09 01:19:30,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 262 flow [2025-03-09 01:19:30,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 220 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-03-09 01:19:30,225 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 170 flow [2025-03-09 01:19:30,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=170, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2025-03-09 01:19:30,225 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2025-03-09 01:19:30,226 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 170 flow [2025-03-09 01:19:30,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 19.833333333333332) internal successors, (357), 18 states have internal predecessors, (357), 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:19:30,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:30,226 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:30,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:30,426 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,SelfDestructingSolverStorable3 [2025-03-09 01:19:30,427 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:19:30,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:30,427 INFO L85 PathProgramCache]: Analyzing trace with hash -247269669, now seen corresponding path program 1 times [2025-03-09 01:19:30,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:30,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999362480] [2025-03-09 01:19:30,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:30,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:30,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:19:30,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:19:30,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:30,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:30,586 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-09 01:19:30,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:30,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999362480] [2025-03-09 01:19:30,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999362480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:30,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:30,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:19:30,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189383639] [2025-03-09 01:19:30,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:30,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:19:30,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:30,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:19:30,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:19:30,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2025-03-09 01:19:30,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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:19:30,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:30,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2025-03-09 01:19:30,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:30,674 INFO L124 PetriNetUnfolderBase]: 50/157 cut-off events. [2025-03-09 01:19:30,674 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-09 01:19:30,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 157 events. 50/157 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 543 event pairs, 31 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 220. Up to 86 conditions per place. [2025-03-09 01:19:30,675 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 30 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2025-03-09 01:19:30,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 232 flow [2025-03-09 01:19:30,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:19:30,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:19:30,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-03-09 01:19:30,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-03-09 01:19:30,678 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 170 flow. Second operand 5 states and 98 transitions. [2025-03-09 01:19:30,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 232 flow [2025-03-09 01:19:30,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 200 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-09 01:19:30,679 INFO L231 Difference]: Finished difference. Result has 42 places, 43 transitions, 140 flow [2025-03-09 01:19:30,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=42, PETRI_TRANSITIONS=43} [2025-03-09 01:19:30,679 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2025-03-09 01:19:30,679 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 43 transitions, 140 flow [2025-03-09 01:19:30,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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:19:30,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:30,680 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:30,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:19:30,680 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:19:30,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:30,680 INFO L85 PathProgramCache]: Analyzing trace with hash -247269668, now seen corresponding path program 1 times [2025-03-09 01:19:30,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:30,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203205599] [2025-03-09 01:19:30,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:30,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:30,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:19:30,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:19:30,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:30,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:31,099 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:31,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:31,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203205599] [2025-03-09 01:19:31,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203205599] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:31,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280830022] [2025-03-09 01:19:31,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:31,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:31,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:31,102 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:19:31,103 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:19:31,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:19:31,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:19:31,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:31,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:31,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-09 01:19:31,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:31,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:19:31,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:19:31,285 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 01:19:31,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-09 01:19:31,304 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:19:31,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:19:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:31,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:31,988 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:31,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280830022] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:31,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:19:31,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 24 [2025-03-09 01:19:31,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010525045] [2025-03-09 01:19:31,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:31,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:19:31,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:31,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:19:31,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:19:32,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-03-09 01:19:32,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 43 transitions, 140 flow. Second operand has 10 states, 10 states have (on average 19.8) internal successors, (198), 10 states have internal predecessors, (198), 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:19:32,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:32,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-03-09 01:19:32,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:32,262 INFO L124 PetriNetUnfolderBase]: 86/234 cut-off events. [2025-03-09 01:19:32,262 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:19:32,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 234 events. 86/234 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 920 event pairs, 31 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 365. Up to 78 conditions per place. [2025-03-09 01:19:32,264 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 39 selfloop transitions, 6 changer transitions 0/54 dead transitions. [2025-03-09 01:19:32,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 255 flow [2025-03-09 01:19:32,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:19:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:19:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2025-03-09 01:19:32,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5634920634920635 [2025-03-09 01:19:32,266 INFO L175 Difference]: Start difference. First operand has 42 places, 43 transitions, 140 flow. Second operand 6 states and 142 transitions. [2025-03-09 01:19:32,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 255 flow [2025-03-09 01:19:32,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 250 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:19:32,267 INFO L231 Difference]: Finished difference. Result has 46 places, 44 transitions, 160 flow [2025-03-09 01:19:32,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=46, PETRI_TRANSITIONS=44} [2025-03-09 01:19:32,268 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2025-03-09 01:19:32,268 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 44 transitions, 160 flow [2025-03-09 01:19:32,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.8) internal successors, (198), 10 states have internal predecessors, (198), 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:19:32,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:32,268 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:32,274 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:19:32,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:32,469 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:19:32,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:32,469 INFO L85 PathProgramCache]: Analyzing trace with hash 924575380, now seen corresponding path program 1 times [2025-03-09 01:19:32,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:32,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689083480] [2025-03-09 01:19:32,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:32,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:32,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:19:32,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:19:32,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:32,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:32,707 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-09 01:19:32,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:32,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689083480] [2025-03-09 01:19:32,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689083480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:32,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775385554] [2025-03-09 01:19:32,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:32,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:32,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:32,710 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:19:32,712 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:19:32,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:19:32,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:19:32,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:32,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:32,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:19:32,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:32,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:32,940 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 22 treesize of output 18 [2025-03-09 01:19:33,025 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:33,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775385554] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:33,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:33,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 20 [2025-03-09 01:19:33,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928586282] [2025-03-09 01:19:33,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:33,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 01:19:33,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:33,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 01:19:33,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-09 01:19:33,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2025-03-09 01:19:33,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 160 flow. Second operand has 21 states, 21 states have (on average 20.904761904761905) internal successors, (439), 21 states have internal predecessors, (439), 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:19:33,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:33,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2025-03-09 01:19:33,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:33,660 INFO L124 PetriNetUnfolderBase]: 100/297 cut-off events. [2025-03-09 01:19:33,661 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-03-09 01:19:33,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 297 events. 100/297 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1289 event pairs, 31 based on Foata normal form. 16/293 useless extension candidates. Maximal degree in co-relation 555. Up to 86 conditions per place. [2025-03-09 01:19:33,662 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 49 selfloop transitions, 14 changer transitions 0/74 dead transitions. [2025-03-09 01:19:33,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 74 transitions, 376 flow [2025-03-09 01:19:33,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:19:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:19:33,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 251 transitions. [2025-03-09 01:19:33,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5976190476190476 [2025-03-09 01:19:33,665 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 160 flow. Second operand 10 states and 251 transitions. [2025-03-09 01:19:33,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 74 transitions, 376 flow [2025-03-09 01:19:33,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 366 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:19:33,669 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 200 flow [2025-03-09 01:19:33,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=200, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2025-03-09 01:19:33,669 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2025-03-09 01:19:33,669 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 200 flow [2025-03-09 01:19:33,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 20.904761904761905) internal successors, (439), 21 states have internal predecessors, (439), 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:19:33,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:33,671 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:33,677 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:19:33,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:33,871 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:19:33,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:33,872 INFO L85 PathProgramCache]: Analyzing trace with hash 924575379, now seen corresponding path program 1 times [2025-03-09 01:19:33,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:33,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917451364] [2025-03-09 01:19:33,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:33,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:33,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:19:33,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:19:33,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:33,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:33,935 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-09 01:19:33,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:33,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917451364] [2025-03-09 01:19:33,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917451364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:33,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:33,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:19:33,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402210982] [2025-03-09 01:19:33,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:33,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:33,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:33,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:33,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:33,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2025-03-09 01:19:33,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:19:33,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:33,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2025-03-09 01:19:33,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:34,021 INFO L124 PetriNetUnfolderBase]: 113/289 cut-off events. [2025-03-09 01:19:34,021 INFO L125 PetriNetUnfolderBase]: For 205/210 co-relation queries the response was YES. [2025-03-09 01:19:34,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 289 events. 113/289 cut-off events. For 205/210 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1174 event pairs, 84 based on Foata normal form. 21/301 useless extension candidates. Maximal degree in co-relation 613. Up to 200 conditions per place. [2025-03-09 01:19:34,023 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 33 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2025-03-09 01:19:34,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 44 transitions, 266 flow [2025-03-09 01:19:34,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:19:34,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:19:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-03-09 01:19:34,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49404761904761907 [2025-03-09 01:19:34,024 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 200 flow. Second operand 4 states and 83 transitions. [2025-03-09 01:19:34,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 44 transitions, 266 flow [2025-03-09 01:19:34,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 245 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:19:34,025 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 179 flow [2025-03-09 01:19:34,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2025-03-09 01:19:34,026 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2025-03-09 01:19:34,026 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 179 flow [2025-03-09 01:19:34,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:19:34,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:34,026 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:34,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:19:34,026 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:19:34,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:34,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1425420073, now seen corresponding path program 1 times [2025-03-09 01:19:34,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:34,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953286968] [2025-03-09 01:19:34,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:34,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:34,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:19:34,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:19:34,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:34,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:34,210 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-09 01:19:34,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:34,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953286968] [2025-03-09 01:19:34,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953286968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:34,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001296424] [2025-03-09 01:19:34,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:34,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:34,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:34,213 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:19:34,214 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:19:34,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:19:34,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:19:34,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:34,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:34,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:19:34,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:34,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:34,464 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 22 treesize of output 18 [2025-03-09 01:19:34,535 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:34,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001296424] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:34,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:34,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 20 [2025-03-09 01:19:34,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917012975] [2025-03-09 01:19:34,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:34,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 01:19:34,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:34,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 01:19:34,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-09 01:19:34,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-03-09 01:19:34,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 179 flow. Second operand has 21 states, 21 states have (on average 20.19047619047619) internal successors, (424), 21 states have internal predecessors, (424), 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:19:34,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:34,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-03-09 01:19:34,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:35,030 INFO L124 PetriNetUnfolderBase]: 257/593 cut-off events. [2025-03-09 01:19:35,031 INFO L125 PetriNetUnfolderBase]: For 479/496 co-relation queries the response was YES. [2025-03-09 01:19:35,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1428 conditions, 593 events. 257/593 cut-off events. For 479/496 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2875 event pairs, 84 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 1331. Up to 183 conditions per place. [2025-03-09 01:19:35,038 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 52 selfloop transitions, 15 changer transitions 0/75 dead transitions. [2025-03-09 01:19:35,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 75 transitions, 443 flow [2025-03-09 01:19:35,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:19:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:19:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 239 transitions. [2025-03-09 01:19:35,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.569047619047619 [2025-03-09 01:19:35,039 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 179 flow. Second operand 10 states and 239 transitions. [2025-03-09 01:19:35,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 75 transitions, 443 flow [2025-03-09 01:19:35,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 75 transitions, 440 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:19:35,040 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 225 flow [2025-03-09 01:19:35,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=225, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2025-03-09 01:19:35,040 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2025-03-09 01:19:35,041 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 225 flow [2025-03-09 01:19:35,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 20.19047619047619) internal successors, (424), 21 states have internal predecessors, (424), 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:19:35,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:35,041 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:35,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 01:19:35,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:35,247 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:19:35,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:35,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1238348798, now seen corresponding path program 1 times [2025-03-09 01:19:35,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:35,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356411800] [2025-03-09 01:19:35,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:35,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:35,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 01:19:35,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:19:35,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:35,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:35,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:35,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356411800] [2025-03-09 01:19:35,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356411800] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:35,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550680173] [2025-03-09 01:19:35,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:35,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:35,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:35,505 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:19:35,507 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:19:35,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 01:19:35,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:19:35,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:35,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:35,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-09 01:19:35,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:35,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:19:35,645 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-09 01:19:35,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-09 01:19:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:35,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:36,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550680173] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:36,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:19:36,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 9] total 25 [2025-03-09 01:19:36,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168571635] [2025-03-09 01:19:36,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:36,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:19:36,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:36,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:19:36,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2025-03-09 01:19:36,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2025-03-09 01:19:36,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 225 flow. Second operand has 10 states, 10 states have (on average 21.0) internal successors, (210), 10 states have internal predecessors, (210), 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:19:36,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:36,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2025-03-09 01:19:36,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:36,345 INFO L124 PetriNetUnfolderBase]: 206/516 cut-off events. [2025-03-09 01:19:36,345 INFO L125 PetriNetUnfolderBase]: For 534/547 co-relation queries the response was YES. [2025-03-09 01:19:36,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 516 events. 206/516 cut-off events. For 534/547 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2507 event pairs, 128 based on Foata normal form. 17/521 useless extension candidates. Maximal degree in co-relation 1292. Up to 271 conditions per place. [2025-03-09 01:19:36,347 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 41 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2025-03-09 01:19:36,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 56 transitions, 363 flow [2025-03-09 01:19:36,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:19:36,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:19:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-03-09 01:19:36,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5753968253968254 [2025-03-09 01:19:36,348 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 225 flow. Second operand 6 states and 145 transitions. [2025-03-09 01:19:36,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 56 transitions, 363 flow [2025-03-09 01:19:36,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 342 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:19:36,350 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 218 flow [2025-03-09 01:19:36,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2025-03-09 01:19:36,350 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2025-03-09 01:19:36,350 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 218 flow [2025-03-09 01:19:36,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.0) internal successors, (210), 10 states have internal predecessors, (210), 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:19:36,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:36,350 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:36,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:36,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:36,551 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:19:36,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:36,551 INFO L85 PathProgramCache]: Analyzing trace with hash -541271463, now seen corresponding path program 1 times [2025-03-09 01:19:36,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:36,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043508969] [2025-03-09 01:19:36,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:36,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:36,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 01:19:36,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:19:36,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:36,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:36,836 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:36,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:36,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043508969] [2025-03-09 01:19:36,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043508969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:36,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066408262] [2025-03-09 01:19:36,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:36,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:36,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:36,839 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:19:36,840 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:19:36,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 01:19:36,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:19:36,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:36,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:36,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-09 01:19:36,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:36,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:19:36,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:19:36,992 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 01:19:36,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-09 01:19:37,005 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:19:37,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:19:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:37,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:37,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066408262] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:37,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:37,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2025-03-09 01:19:37,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046879050] [2025-03-09 01:19:37,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:37,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-09 01:19:37,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:37,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-09 01:19:37,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2025-03-09 01:19:38,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2025-03-09 01:19:38,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 218 flow. Second operand has 29 states, 29 states have (on average 16.06896551724138) internal successors, (466), 29 states have internal predecessors, (466), 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:19:38,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:38,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2025-03-09 01:19:38,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:38,603 INFO L124 PetriNetUnfolderBase]: 382/897 cut-off events. [2025-03-09 01:19:38,603 INFO L125 PetriNetUnfolderBase]: For 1191/1217 co-relation queries the response was YES. [2025-03-09 01:19:38,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2511 conditions, 897 events. 382/897 cut-off events. For 1191/1217 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4843 event pairs, 72 based on Foata normal form. 48/934 useless extension candidates. Maximal degree in co-relation 2407. Up to 160 conditions per place. [2025-03-09 01:19:38,609 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 77 selfloop transitions, 17 changer transitions 0/102 dead transitions. [2025-03-09 01:19:38,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 102 transitions, 632 flow [2025-03-09 01:19:38,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 01:19:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-09 01:19:38,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 326 transitions. [2025-03-09 01:19:38,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4565826330532213 [2025-03-09 01:19:38,611 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 218 flow. Second operand 17 states and 326 transitions. [2025-03-09 01:19:38,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 102 transitions, 632 flow [2025-03-09 01:19:38,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 102 transitions, 606 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 01:19:38,615 INFO L231 Difference]: Finished difference. Result has 73 places, 48 transitions, 273 flow [2025-03-09 01:19:38,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=273, PETRI_PLACES=73, PETRI_TRANSITIONS=48} [2025-03-09 01:19:38,616 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2025-03-09 01:19:38,617 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 48 transitions, 273 flow [2025-03-09 01:19:38,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 16.06896551724138) internal successors, (466), 29 states have internal predecessors, (466), 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:19:38,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:38,618 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:38,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:38,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:38,818 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:19:38,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:38,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2120618354, now seen corresponding path program 1 times [2025-03-09 01:19:38,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:38,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106205025] [2025-03-09 01:19:38,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:38,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:38,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 01:19:38,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:19:38,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:38,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:39,072 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:39,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:39,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106205025] [2025-03-09 01:19:39,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106205025] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:39,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279722556] [2025-03-09 01:19:39,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:39,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:39,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:39,075 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:19:39,076 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:19:39,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 01:19:39,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:19:39,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:39,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:39,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-09 01:19:39,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:39,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:19:39,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:19:39,216 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 01:19:39,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-09 01:19:39,227 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:19:39,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:19:39,501 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:39,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:39,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279722556] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:39,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:39,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2025-03-09 01:19:39,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75348016] [2025-03-09 01:19:39,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:39,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 01:19:39,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:39,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 01:19:39,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:19:40,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2025-03-09 01:19:40,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 48 transitions, 273 flow. Second operand has 28 states, 28 states have (on average 17.25) internal successors, (483), 28 states have internal predecessors, (483), 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:19:40,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:40,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2025-03-09 01:19:40,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:40,691 INFO L124 PetriNetUnfolderBase]: 456/1217 cut-off events. [2025-03-09 01:19:40,691 INFO L125 PetriNetUnfolderBase]: For 2098/2144 co-relation queries the response was YES. [2025-03-09 01:19:40,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3527 conditions, 1217 events. 456/1217 cut-off events. For 2098/2144 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 7694 event pairs, 138 based on Foata normal form. 81/1258 useless extension candidates. Maximal degree in co-relation 3411. Up to 306 conditions per place. [2025-03-09 01:19:40,696 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 76 selfloop transitions, 16 changer transitions 0/103 dead transitions. [2025-03-09 01:19:40,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 103 transitions, 791 flow [2025-03-09 01:19:40,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 01:19:40,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-09 01:19:40,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 331 transitions. [2025-03-09 01:19:40,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4635854341736695 [2025-03-09 01:19:40,697 INFO L175 Difference]: Start difference. First operand has 73 places, 48 transitions, 273 flow. Second operand 17 states and 331 transitions. [2025-03-09 01:19:40,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 103 transitions, 791 flow [2025-03-09 01:19:40,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 103 transitions, 723 flow, removed 10 selfloop flow, removed 8 redundant places. [2025-03-09 01:19:40,701 INFO L231 Difference]: Finished difference. Result has 84 places, 51 transitions, 309 flow [2025-03-09 01:19:40,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=309, PETRI_PLACES=84, PETRI_TRANSITIONS=51} [2025-03-09 01:19:40,702 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2025-03-09 01:19:40,703 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 51 transitions, 309 flow [2025-03-09 01:19:40,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 17.25) internal successors, (483), 28 states have internal predecessors, (483), 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:19:40,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:40,704 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:40,710 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:19:40,908 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,SelfDestructingSolverStorable11 [2025-03-09 01:19:40,908 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:19:40,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:40,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1483714636, now seen corresponding path program 1 times [2025-03-09 01:19:40,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:40,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547371237] [2025-03-09 01:19:40,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:40,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:40,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:19:40,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:19:40,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:40,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-09 01:19:41,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:41,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547371237] [2025-03-09 01:19:41,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547371237] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:41,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400642624] [2025-03-09 01:19:41,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:41,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:41,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:41,100 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:19:41,102 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:19:41,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:19:41,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:19:41,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:41,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:41,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 01:19:41,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:41,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:41,464 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 24 treesize of output 20 [2025-03-09 01:19:41,550 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:41,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400642624] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:41,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:41,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 27 [2025-03-09 01:19:41,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835404578] [2025-03-09 01:19:41,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:41,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 01:19:41,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:41,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 01:19:41,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:19:41,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2025-03-09 01:19:41,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 51 transitions, 309 flow. Second operand has 28 states, 28 states have (on average 20.678571428571427) internal successors, (579), 28 states have internal predecessors, (579), 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:19:41,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:41,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2025-03-09 01:19:41,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:42,464 INFO L124 PetriNetUnfolderBase]: 559/1433 cut-off events. [2025-03-09 01:19:42,464 INFO L125 PetriNetUnfolderBase]: For 3175/3210 co-relation queries the response was YES. [2025-03-09 01:19:42,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4516 conditions, 1433 events. 559/1433 cut-off events. For 3175/3210 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 8973 event pairs, 110 based on Foata normal form. 72/1475 useless extension candidates. Maximal degree in co-relation 4395. Up to 270 conditions per place. [2025-03-09 01:19:42,471 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 103 selfloop transitions, 17 changer transitions 0/131 dead transitions. [2025-03-09 01:19:42,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 131 transitions, 974 flow [2025-03-09 01:19:42,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:19:42,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:19:42,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 342 transitions. [2025-03-09 01:19:42,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6263736263736264 [2025-03-09 01:19:42,474 INFO L175 Difference]: Start difference. First operand has 84 places, 51 transitions, 309 flow. Second operand 13 states and 342 transitions. [2025-03-09 01:19:42,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 131 transitions, 974 flow [2025-03-09 01:19:42,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 131 transitions, 941 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-09 01:19:42,480 INFO L231 Difference]: Finished difference. Result has 87 places, 53 transitions, 352 flow [2025-03-09 01:19:42,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=352, PETRI_PLACES=87, PETRI_TRANSITIONS=53} [2025-03-09 01:19:42,481 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2025-03-09 01:19:42,481 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 53 transitions, 352 flow [2025-03-09 01:19:42,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 20.678571428571427) internal successors, (579), 28 states have internal predecessors, (579), 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:19:42,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:42,481 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:42,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 01:19:42,681 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,SelfDestructingSolverStorable12 [2025-03-09 01:19:42,682 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:19:42,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:42,682 INFO L85 PathProgramCache]: Analyzing trace with hash 66882151, now seen corresponding path program 1 times [2025-03-09 01:19:42,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:42,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061529164] [2025-03-09 01:19:42,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:42,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:42,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:19:42,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:19:42,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:42,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:42,783 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:42,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:42,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061529164] [2025-03-09 01:19:42,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061529164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:42,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:42,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:19:42,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858309105] [2025-03-09 01:19:42,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:42,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:42,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:42,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:42,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:42,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2025-03-09 01:19:42,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 53 transitions, 352 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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:19:42,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:42,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2025-03-09 01:19:42,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:42,967 INFO L124 PetriNetUnfolderBase]: 522/1406 cut-off events. [2025-03-09 01:19:42,967 INFO L125 PetriNetUnfolderBase]: For 3437/3479 co-relation queries the response was YES. [2025-03-09 01:19:42,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4552 conditions, 1406 events. 522/1406 cut-off events. For 3437/3479 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 9068 event pairs, 380 based on Foata normal form. 2/1372 useless extension candidates. Maximal degree in co-relation 4427. Up to 822 conditions per place. [2025-03-09 01:19:42,974 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 60 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2025-03-09 01:19:42,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 75 transitions, 658 flow [2025-03-09 01:19:42,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:19:42,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:19:42,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-03-09 01:19:42,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2025-03-09 01:19:42,975 INFO L175 Difference]: Start difference. First operand has 87 places, 53 transitions, 352 flow. Second operand 4 states and 114 transitions. [2025-03-09 01:19:42,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 75 transitions, 658 flow [2025-03-09 01:19:42,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 75 transitions, 620 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-09 01:19:42,981 INFO L231 Difference]: Finished difference. Result has 83 places, 54 transitions, 341 flow [2025-03-09 01:19:42,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=341, PETRI_PLACES=83, PETRI_TRANSITIONS=54} [2025-03-09 01:19:42,983 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2025-03-09 01:19:42,983 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 54 transitions, 341 flow [2025-03-09 01:19:42,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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:19:42,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:42,983 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:42,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:19:42,984 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:19:42,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:42,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2109028021, now seen corresponding path program 2 times [2025-03-09 01:19:42,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:42,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164428252] [2025-03-09 01:19:42,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:42,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:42,991 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-09 01:19:42,996 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 35 statements. [2025-03-09 01:19:42,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:19:42,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:43,052 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:43,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:43,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164428252] [2025-03-09 01:19:43,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164428252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:43,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:43,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:19:43,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943394587] [2025-03-09 01:19:43,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:43,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:43,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:43,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:43,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:43,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2025-03-09 01:19:43,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 54 transitions, 341 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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:19:43,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:43,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2025-03-09 01:19:43,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:43,213 INFO L124 PetriNetUnfolderBase]: 519/1404 cut-off events. [2025-03-09 01:19:43,214 INFO L125 PetriNetUnfolderBase]: For 3807/3863 co-relation queries the response was YES. [2025-03-09 01:19:43,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4859 conditions, 1404 events. 519/1404 cut-off events. For 3807/3863 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 8970 event pairs, 357 based on Foata normal form. 3/1364 useless extension candidates. Maximal degree in co-relation 4742. Up to 838 conditions per place. [2025-03-09 01:19:43,222 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 62 selfloop transitions, 3 changer transitions 2/79 dead transitions. [2025-03-09 01:19:43,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 79 transitions, 628 flow [2025-03-09 01:19:43,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:19:43,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:19:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-03-09 01:19:43,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2025-03-09 01:19:43,224 INFO L175 Difference]: Start difference. First operand has 83 places, 54 transitions, 341 flow. Second operand 4 states and 117 transitions. [2025-03-09 01:19:43,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 79 transitions, 628 flow [2025-03-09 01:19:43,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 79 transitions, 618 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:19:43,228 INFO L231 Difference]: Finished difference. Result has 86 places, 55 transitions, 353 flow [2025-03-09 01:19:43,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=353, PETRI_PLACES=86, PETRI_TRANSITIONS=55} [2025-03-09 01:19:43,229 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 44 predicate places. [2025-03-09 01:19:43,229 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 55 transitions, 353 flow [2025-03-09 01:19:43,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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:19:43,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:43,229 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:43,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:19:43,229 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:19:43,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:43,230 INFO L85 PathProgramCache]: Analyzing trace with hash -790803087, now seen corresponding path program 3 times [2025-03-09 01:19:43,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:43,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044542697] [2025-03-09 01:19:43,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:19:43,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:43,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 6 equivalence classes. [2025-03-09 01:19:43,251 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 35 statements. [2025-03-09 01:19:43,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:19:43,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:43,313 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:43,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:43,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044542697] [2025-03-09 01:19:43,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044542697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:43,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:43,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:19:43,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865671358] [2025-03-09 01:19:43,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:43,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:43,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:43,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:43,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:43,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2025-03-09 01:19:43,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 55 transitions, 353 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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:19:43,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:43,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2025-03-09 01:19:43,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:43,512 INFO L124 PetriNetUnfolderBase]: 786/1802 cut-off events. [2025-03-09 01:19:43,513 INFO L125 PetriNetUnfolderBase]: For 5673/5735 co-relation queries the response was YES. [2025-03-09 01:19:43,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6529 conditions, 1802 events. 786/1802 cut-off events. For 5673/5735 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 11189 event pairs, 552 based on Foata normal form. 30/1820 useless extension candidates. Maximal degree in co-relation 6410. Up to 1130 conditions per place. [2025-03-09 01:19:43,523 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 66 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2025-03-09 01:19:43,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 81 transitions, 706 flow [2025-03-09 01:19:43,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:19:43,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:19:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-03-09 01:19:43,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2025-03-09 01:19:43,524 INFO L175 Difference]: Start difference. First operand has 86 places, 55 transitions, 353 flow. Second operand 4 states and 114 transitions. [2025-03-09 01:19:43,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 81 transitions, 706 flow [2025-03-09 01:19:43,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 81 transitions, 694 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:19:43,530 INFO L231 Difference]: Finished difference. Result has 89 places, 57 transitions, 384 flow [2025-03-09 01:19:43,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=384, PETRI_PLACES=89, PETRI_TRANSITIONS=57} [2025-03-09 01:19:43,531 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2025-03-09 01:19:43,532 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 57 transitions, 384 flow [2025-03-09 01:19:43,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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:19:43,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:43,532 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:43,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:19:43,532 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:19:43,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:43,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1630752639, now seen corresponding path program 4 times [2025-03-09 01:19:43,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:43,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715177243] [2025-03-09 01:19:43,533 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:19:43,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:43,541 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-03-09 01:19:43,553 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:19:43,553 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:19:43,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:43,633 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:43,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:43,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715177243] [2025-03-09 01:19:43,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715177243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:43,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:43,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:19:43,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765365919] [2025-03-09 01:19:43,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:43,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:43,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:43,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:43,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:43,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2025-03-09 01:19:43,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 57 transitions, 384 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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:19:43,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:43,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2025-03-09 01:19:43,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:43,802 INFO L124 PetriNetUnfolderBase]: 543/1610 cut-off events. [2025-03-09 01:19:43,802 INFO L125 PetriNetUnfolderBase]: For 5474/5506 co-relation queries the response was YES. [2025-03-09 01:19:43,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6048 conditions, 1610 events. 543/1610 cut-off events. For 5474/5506 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 10998 event pairs, 234 based on Foata normal form. 30/1638 useless extension candidates. Maximal degree in co-relation 5927. Up to 916 conditions per place. [2025-03-09 01:19:43,813 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 58 selfloop transitions, 6 changer transitions 1/78 dead transitions. [2025-03-09 01:19:43,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 78 transitions, 687 flow [2025-03-09 01:19:43,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:19:43,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:19:43,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-03-09 01:19:43,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-09 01:19:43,814 INFO L175 Difference]: Start difference. First operand has 89 places, 57 transitions, 384 flow. Second operand 4 states and 112 transitions. [2025-03-09 01:19:43,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 78 transitions, 687 flow [2025-03-09 01:19:43,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 78 transitions, 680 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:19:43,820 INFO L231 Difference]: Finished difference. Result has 93 places, 58 transitions, 421 flow [2025-03-09 01:19:43,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=421, PETRI_PLACES=93, PETRI_TRANSITIONS=58} [2025-03-09 01:19:43,821 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 51 predicate places. [2025-03-09 01:19:43,821 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 58 transitions, 421 flow [2025-03-09 01:19:43,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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:19:43,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:43,821 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:43,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 01:19:43,821 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:19:43,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:43,821 INFO L85 PathProgramCache]: Analyzing trace with hash 2099758807, now seen corresponding path program 1 times [2025-03-09 01:19:43,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:43,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903866018] [2025-03-09 01:19:43,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:43,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:43,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:19:43,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:19:43,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:43,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:44,019 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-09 01:19:44,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:44,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903866018] [2025-03-09 01:19:44,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903866018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:44,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026880355] [2025-03-09 01:19:44,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:44,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:44,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:44,022 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:19:44,023 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:19:44,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:19:44,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:19:44,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:44,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:44,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-09 01:19:44,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:44,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:19:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:44,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:44,506 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:44,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026880355] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:44,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:44,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 27 [2025-03-09 01:19:44,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777785492] [2025-03-09 01:19:44,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:44,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 01:19:44,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:44,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 01:19:44,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:19:44,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42 [2025-03-09 01:19:44,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 58 transitions, 421 flow. Second operand has 28 states, 28 states have (on average 18.107142857142858) internal successors, (507), 28 states have internal predecessors, (507), 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:19:44,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:44,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42 [2025-03-09 01:19:44,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:45,470 INFO L124 PetriNetUnfolderBase]: 932/1994 cut-off events. [2025-03-09 01:19:45,470 INFO L125 PetriNetUnfolderBase]: For 8626/8688 co-relation queries the response was YES. [2025-03-09 01:19:45,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7859 conditions, 1994 events. 932/1994 cut-off events. For 8626/8688 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 11824 event pairs, 168 based on Foata normal form. 96/2060 useless extension candidates. Maximal degree in co-relation 7733. Up to 344 conditions per place. [2025-03-09 01:19:45,485 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 107 selfloop transitions, 20 changer transitions 0/137 dead transitions. [2025-03-09 01:19:45,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 137 transitions, 1270 flow [2025-03-09 01:19:45,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:19:45,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:19:45,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 295 transitions. [2025-03-09 01:19:45,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5402930402930403 [2025-03-09 01:19:45,487 INFO L175 Difference]: Start difference. First operand has 93 places, 58 transitions, 421 flow. Second operand 13 states and 295 transitions. [2025-03-09 01:19:45,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 137 transitions, 1270 flow [2025-03-09 01:19:45,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 137 transitions, 1251 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-09 01:19:45,495 INFO L231 Difference]: Finished difference. Result has 104 places, 59 transitions, 473 flow [2025-03-09 01:19:45,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=473, PETRI_PLACES=104, PETRI_TRANSITIONS=59} [2025-03-09 01:19:45,495 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 62 predicate places. [2025-03-09 01:19:45,496 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 59 transitions, 473 flow [2025-03-09 01:19:45,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 18.107142857142858) internal successors, (507), 28 states have internal predecessors, (507), 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:19:45,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:45,496 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:45,503 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:19:45,700 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,SelfDestructingSolverStorable17 [2025-03-09 01:19:45,700 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:19:45,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:45,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1264923223, now seen corresponding path program 1 times [2025-03-09 01:19:45,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:45,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879831588] [2025-03-09 01:19:45,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:45,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:45,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 01:19:45,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:19:45,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:45,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:45,816 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:45,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:45,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879831588] [2025-03-09 01:19:45,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879831588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:45,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:45,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:19:45,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470837781] [2025-03-09 01:19:45,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:45,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:45,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:45,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:45,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:45,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2025-03-09 01:19:45,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 59 transitions, 473 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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:19:45,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:45,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2025-03-09 01:19:45,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:46,072 INFO L124 PetriNetUnfolderBase]: 910/2242 cut-off events. [2025-03-09 01:19:46,072 INFO L125 PetriNetUnfolderBase]: For 10517/10572 co-relation queries the response was YES. [2025-03-09 01:19:46,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9007 conditions, 2242 events. 910/2242 cut-off events. For 10517/10572 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 14697 event pairs, 578 based on Foata normal form. 22/2260 useless extension candidates. Maximal degree in co-relation 8869. Up to 1325 conditions per place. [2025-03-09 01:19:46,084 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 67 selfloop transitions, 5 changer transitions 0/85 dead transitions. [2025-03-09 01:19:46,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 85 transitions, 837 flow [2025-03-09 01:19:46,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:19:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:19:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-03-09 01:19:46,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2025-03-09 01:19:46,086 INFO L175 Difference]: Start difference. First operand has 104 places, 59 transitions, 473 flow. Second operand 4 states and 117 transitions. [2025-03-09 01:19:46,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 85 transitions, 837 flow [2025-03-09 01:19:46,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 85 transitions, 771 flow, removed 4 selfloop flow, removed 11 redundant places. [2025-03-09 01:19:46,095 INFO L231 Difference]: Finished difference. Result has 98 places, 61 transitions, 475 flow [2025-03-09 01:19:46,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=475, PETRI_PLACES=98, PETRI_TRANSITIONS=61} [2025-03-09 01:19:46,096 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2025-03-09 01:19:46,096 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 61 transitions, 475 flow [2025-03-09 01:19:46,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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:19:46,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:46,096 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:46,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 01:19:46,096 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:19:46,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:46,097 INFO L85 PathProgramCache]: Analyzing trace with hash -450715045, now seen corresponding path program 2 times [2025-03-09 01:19:46,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:46,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30181774] [2025-03-09 01:19:46,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:46,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:46,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-09 01:19:46,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 38 statements. [2025-03-09 01:19:46,111 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:19:46,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:46,164 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:46,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:46,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30181774] [2025-03-09 01:19:46,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30181774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:46,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:46,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:19:46,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052233029] [2025-03-09 01:19:46,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:46,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:46,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:46,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:46,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:46,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2025-03-09 01:19:46,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 61 transitions, 475 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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:19:46,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:46,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2025-03-09 01:19:46,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:46,356 INFO L124 PetriNetUnfolderBase]: 640/1779 cut-off events. [2025-03-09 01:19:46,356 INFO L125 PetriNetUnfolderBase]: For 9205/9249 co-relation queries the response was YES. [2025-03-09 01:19:46,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7326 conditions, 1779 events. 640/1779 cut-off events. For 9205/9249 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 12043 event pairs, 56 based on Foata normal form. 24/1781 useless extension candidates. Maximal degree in co-relation 7197. Up to 986 conditions per place. [2025-03-09 01:19:46,364 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 55 selfloop transitions, 8 changer transitions 1/79 dead transitions. [2025-03-09 01:19:46,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 79 transitions, 779 flow [2025-03-09 01:19:46,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:19:46,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:19:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-03-09 01:19:46,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2025-03-09 01:19:46,365 INFO L175 Difference]: Start difference. First operand has 98 places, 61 transitions, 475 flow. Second operand 4 states and 110 transitions. [2025-03-09 01:19:46,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 79 transitions, 779 flow [2025-03-09 01:19:46,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 79 transitions, 771 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:19:46,374 INFO L231 Difference]: Finished difference. Result has 102 places, 62 transitions, 523 flow [2025-03-09 01:19:46,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=523, PETRI_PLACES=102, PETRI_TRANSITIONS=62} [2025-03-09 01:19:46,375 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 60 predicate places. [2025-03-09 01:19:46,375 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 62 transitions, 523 flow [2025-03-09 01:19:46,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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:19:46,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:46,375 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:46,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 01:19:46,375 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:19:46,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:46,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1249037156, now seen corresponding path program 2 times [2025-03-09 01:19:46,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:46,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378568784] [2025-03-09 01:19:46,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:46,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:46,383 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-09 01:19:46,393 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:19:46,393 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:19:46,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:46,671 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-09 01:19:46,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:46,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378568784] [2025-03-09 01:19:46,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378568784] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:46,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564727615] [2025-03-09 01:19:46,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:46,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:46,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:46,674 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:19:46,674 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:19:46,738 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-09 01:19:46,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:19:46,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:19:46,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:46,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-09 01:19:46,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:46,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:19:46,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:19:46,872 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:19:46,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:19:46,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:19:47,053 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 20 proven. 31 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:47,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:47,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564727615] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:47,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:47,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 12] total 34 [2025-03-09 01:19:47,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668564656] [2025-03-09 01:19:47,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:47,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-09 01:19:47,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:47,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-09 01:19:47,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 01:19:48,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2025-03-09 01:19:48,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 62 transitions, 523 flow. Second operand has 36 states, 36 states have (on average 15.38888888888889) internal successors, (554), 36 states have internal predecessors, (554), 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:19:48,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:48,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2025-03-09 01:19:48,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:49,109 INFO L124 PetriNetUnfolderBase]: 1101/2141 cut-off events. [2025-03-09 01:19:49,109 INFO L125 PetriNetUnfolderBase]: For 12500/12578 co-relation queries the response was YES. [2025-03-09 01:19:49,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9210 conditions, 2141 events. 1101/2141 cut-off events. For 12500/12578 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 12182 event pairs, 73 based on Foata normal form. 56/2146 useless extension candidates. Maximal degree in co-relation 9076. Up to 400 conditions per place. [2025-03-09 01:19:49,119 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 137 selfloop transitions, 22 changer transitions 0/168 dead transitions. [2025-03-09 01:19:49,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 168 transitions, 1627 flow [2025-03-09 01:19:49,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 01:19:49,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-09 01:19:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 373 transitions. [2025-03-09 01:19:49,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.444047619047619 [2025-03-09 01:19:49,120 INFO L175 Difference]: Start difference. First operand has 102 places, 62 transitions, 523 flow. Second operand 20 states and 373 transitions. [2025-03-09 01:19:49,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 168 transitions, 1627 flow [2025-03-09 01:19:49,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 168 transitions, 1579 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-03-09 01:19:49,128 INFO L231 Difference]: Finished difference. Result has 112 places, 62 transitions, 528 flow [2025-03-09 01:19:49,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=528, PETRI_PLACES=112, PETRI_TRANSITIONS=62} [2025-03-09 01:19:49,129 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 70 predicate places. [2025-03-09 01:19:49,129 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 62 transitions, 528 flow [2025-03-09 01:19:49,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 15.38888888888889) internal successors, (554), 36 states have internal predecessors, (554), 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:19:49,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:49,129 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 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:19:49,136 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:19:49,330 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,SelfDestructingSolverStorable20 [2025-03-09 01:19:49,330 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:19:49,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:49,330 INFO L85 PathProgramCache]: Analyzing trace with hash 268172320, now seen corresponding path program 1 times [2025-03-09 01:19:49,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:49,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311290924] [2025-03-09 01:19:49,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:49,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:49,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 01:19:49,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 01:19:49,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:49,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:49,864 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:49,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:49,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311290924] [2025-03-09 01:19:49,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311290924] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:49,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221073247] [2025-03-09 01:19:49,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:49,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:49,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:49,867 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:19:49,868 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:19:49,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 01:19:49,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 01:19:49,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:49,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:49,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 01:19:49,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:50,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:19:50,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2025-03-09 01:19:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:50,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:06,788 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-09 01:20:06,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 50 [2025-03-09 01:20:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:06,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221073247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:06,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:06,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2025-03-09 01:20:06,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103238864] [2025-03-09 01:20:06,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:06,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 01:20:06,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:06,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 01:20:06,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=643, Unknown=3, NotChecked=0, Total=756 [2025-03-09 01:20:10,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:20:14,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:20:18,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:20:22,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:20:26,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:20:30,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-09 01:20:34,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:20:38,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:20:42,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:20:46,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:20:50,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:20:54,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:20:58,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:21:02,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:21:02,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-09 01:21:02,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 62 transitions, 528 flow. Second operand has 28 states, 28 states have (on average 8.107142857142858) internal successors, (227), 28 states have internal predecessors, (227), 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:21:02,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:02,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-09 01:21:02,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:04,139 INFO L124 PetriNetUnfolderBase]: 2546/4407 cut-off events. [2025-03-09 01:21:04,139 INFO L125 PetriNetUnfolderBase]: For 17526/17526 co-relation queries the response was YES. [2025-03-09 01:21:04,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18229 conditions, 4407 events. 2546/4407 cut-off events. For 17526/17526 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 23186 event pairs, 1126 based on Foata normal form. 1/4408 useless extension candidates. Maximal degree in co-relation 18090. Up to 3560 conditions per place. [2025-03-09 01:21:04,159 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 107 selfloop transitions, 23 changer transitions 3/134 dead transitions. [2025-03-09 01:21:04,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 134 transitions, 1307 flow [2025-03-09 01:21:04,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:21:04,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 01:21:04,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 172 transitions. [2025-03-09 01:21:04,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2925170068027211 [2025-03-09 01:21:04,160 INFO L175 Difference]: Start difference. First operand has 112 places, 62 transitions, 528 flow. Second operand 14 states and 172 transitions. [2025-03-09 01:21:04,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 134 transitions, 1307 flow [2025-03-09 01:21:04,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 134 transitions, 1249 flow, removed 1 selfloop flow, removed 18 redundant places. [2025-03-09 01:21:04,174 INFO L231 Difference]: Finished difference. Result has 113 places, 75 transitions, 694 flow [2025-03-09 01:21:04,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=694, PETRI_PLACES=113, PETRI_TRANSITIONS=75} [2025-03-09 01:21:04,175 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2025-03-09 01:21:04,175 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 75 transitions, 694 flow [2025-03-09 01:21:04,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.107142857142858) internal successors, (227), 28 states have internal predecessors, (227), 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:21:04,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:04,175 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 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:21:04,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 01:21:04,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 01:21:04,376 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:21:04,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:04,377 INFO L85 PathProgramCache]: Analyzing trace with hash -389471440, now seen corresponding path program 2 times [2025-03-09 01:21:04,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:04,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130560436] [2025-03-09 01:21:04,377 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:21:04,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:04,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-09 01:21:04,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 41 statements. [2025-03-09 01:21:04,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:21:04,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:21:04,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:04,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130560436] [2025-03-09 01:21:04,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130560436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:04,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:04,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-09 01:21:04,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552092897] [2025-03-09 01:21:04,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:04,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:21:04,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:04,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:21:04,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156