./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-node-trans.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-node-trans.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 c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:20:16,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:20:16,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:20:16,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:20:16,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:20:16,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:20:16,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:20:16,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:20:16,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:20:16,165 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:20:16,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:20:16,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:20:16,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:20:16,165 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:20:16,165 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:20:16,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:20:16,165 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:20:16,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:20:16,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:20:16,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:20:16,166 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:20:16,166 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:20:16,166 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:20:16,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:20:16,166 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:20:16,166 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:20:16,166 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:20:16,166 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:20:16,166 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:20:16,166 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:20:16,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:20:16,166 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:20:16,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:20:16,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:20:16,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:20:16,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:20:16,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:20:16,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:20:16,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:20:16,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:20:16,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:20:16,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:20:16,167 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 -> c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf [2025-03-09 01:20:16,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:20:16,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:20:16,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:20:16,410 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:20:16,410 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:20:16,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-03-09 01:20:17,599 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05fe7cf8d/c0ab0da5869e42f2929b8ae394d2ef9a/FLAGaf3879fa4 [2025-03-09 01:20:17,809 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:20:17,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-03-09 01:20:17,820 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05fe7cf8d/c0ab0da5869e42f2929b8ae394d2ef9a/FLAGaf3879fa4 [2025-03-09 01:20:17,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05fe7cf8d/c0ab0da5869e42f2929b8ae394d2ef9a [2025-03-09 01:20:17,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:20:17,837 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:20:17,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:20:17,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:20:17,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:20:17,844 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:20:17" (1/1) ... [2025-03-09 01:20:17,845 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bfbb909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:17, skipping insertion in model container [2025-03-09 01:20:17,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:20:17" (1/1) ... [2025-03-09 01:20:17,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:20:17,996 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:20:18,001 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:20:18,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:20:18,011 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:20:18,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:20:18,060 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:20:18,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:18 WrapperNode [2025-03-09 01:20:18,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:20:18,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:20:18,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:20:18,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:20:18,067 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:20:18" (1/1) ... [2025-03-09 01:20:18,073 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:20:18" (1/1) ... [2025-03-09 01:20:18,098 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 408 [2025-03-09 01:20:18,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:20:18,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:20:18,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:20:18,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:20:18,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:18" (1/1) ... [2025-03-09 01:20:18,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:18" (1/1) ... [2025-03-09 01:20:18,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:18" (1/1) ... [2025-03-09 01:20:18,126 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 15, 9]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2025-03-09 01:20:18,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:18" (1/1) ... [2025-03-09 01:20:18,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:18" (1/1) ... [2025-03-09 01:20:18,139 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:18" (1/1) ... [2025-03-09 01:20:18,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:18" (1/1) ... [2025-03-09 01:20:18,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:18" (1/1) ... [2025-03-09 01:20:18,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:18" (1/1) ... [2025-03-09 01:20:18,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:20:18,146 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:20:18,146 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:20:18,146 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:20:18,147 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:18" (1/1) ... [2025-03-09 01:20:18,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:20:18,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:18,175 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:20:18,178 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:20:18,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:20:18,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:20:18,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:20:18,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:20:18,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:20:18,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:20:18,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:20:18,196 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:20:18,196 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:20:18,196 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:20:18,196 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:20:18,196 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:20:18,196 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:20:18,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:20:18,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:20:18,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:20:18,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:20:18,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:20:18,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:20:18,198 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:20:18,289 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:20:18,290 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:20:18,870 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:20:18,870 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:20:19,181 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:20:19,181 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:20:19,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:20:19 BoogieIcfgContainer [2025-03-09 01:20:19,183 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:20:19,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:20:19,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:20:19,189 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:20:19,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:20:17" (1/3) ... [2025-03-09 01:20:19,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6eddab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:20:19, skipping insertion in model container [2025-03-09 01:20:19,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:18" (2/3) ... [2025-03-09 01:20:19,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6eddab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:20:19, skipping insertion in model container [2025-03-09 01:20:19,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:20:19" (3/3) ... [2025-03-09 01:20:19,192 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2025-03-09 01:20:19,206 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:20:19,207 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-trans.wvr.c that has 4 procedures, 109 locations, 1 initial locations, 6 loop locations, and 50 error locations. [2025-03-09 01:20:19,208 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:20:19,280 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 01:20:19,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 120 transitions, 261 flow [2025-03-09 01:20:19,360 INFO L124 PetriNetUnfolderBase]: 12/117 cut-off events. [2025-03-09 01:20:19,364 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:20:19,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 12/117 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 385 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2025-03-09 01:20:19,372 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 120 transitions, 261 flow [2025-03-09 01:20:19,376 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 116 transitions, 250 flow [2025-03-09 01:20:19,386 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:20:19,397 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;@3ae9ace8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:20:19,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 89 error locations. [2025-03-09 01:20:19,402 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:20:19,402 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:20:19,402 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:20:19,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:19,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:20:19,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-09 01:20:19,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:19,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1218081, now seen corresponding path program 1 times [2025-03-09 01:20:19,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:19,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125026840] [2025-03-09 01:20:19,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:19,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:19,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:20:19,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:20:19,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:19,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:19,629 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:20:19,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:19,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125026840] [2025-03-09 01:20:19,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125026840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:19,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:19,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:20:19,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921104882] [2025-03-09 01:20:19,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:19,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:20:19,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:19,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:20:19,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:20:19,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-09 01:20:19,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 116 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 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:20:19,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:19,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-09 01:20:19,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:20,368 INFO L124 PetriNetUnfolderBase]: 2263/4993 cut-off events. [2025-03-09 01:20:20,369 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2025-03-09 01:20:20,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8166 conditions, 4993 events. 2263/4993 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40782 event pairs, 1414 based on Foata normal form. 1/3839 useless extension candidates. Maximal degree in co-relation 7651. Up to 3012 conditions per place. [2025-03-09 01:20:20,417 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 48 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2025-03-09 01:20:20,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 111 transitions, 340 flow [2025-03-09 01:20:20,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:20:20,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:20:20,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2025-03-09 01:20:20,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6916666666666667 [2025-03-09 01:20:20,432 INFO L175 Difference]: Start difference. First operand has 114 places, 116 transitions, 250 flow. Second operand 3 states and 249 transitions. [2025-03-09 01:20:20,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 111 transitions, 340 flow [2025-03-09 01:20:20,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 111 transitions, 328 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:20:20,445 INFO L231 Difference]: Finished difference. Result has 105 places, 111 transitions, 232 flow [2025-03-09 01:20:20,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=105, PETRI_TRANSITIONS=111} [2025-03-09 01:20:20,451 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -9 predicate places. [2025-03-09 01:20:20,451 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 111 transitions, 232 flow [2025-03-09 01:20:20,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 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:20:20,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:20,452 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:20:20,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:20:20,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-09 01:20:20,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:20,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1218082, now seen corresponding path program 1 times [2025-03-09 01:20:20,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:20,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955605913] [2025-03-09 01:20:20,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:20,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:20,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:20:20,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:20:20,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:20,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:20,783 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:20:20,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:20,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955605913] [2025-03-09 01:20:20,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955605913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:20,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:20,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:20:20,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863717953] [2025-03-09 01:20:20,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:20,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:20,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:20,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:20,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:20:20,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-09 01:20:20,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 111 transitions, 232 flow. Second operand has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 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:20:20,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:20,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-09 01:20:20,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:21,305 INFO L124 PetriNetUnfolderBase]: 2263/4995 cut-off events. [2025-03-09 01:20:21,306 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-09 01:20:21,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8073 conditions, 4995 events. 2263/4995 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40852 event pairs, 1414 based on Foata normal form. 0/3838 useless extension candidates. Maximal degree in co-relation 8038. Up to 3024 conditions per place. [2025-03-09 01:20:21,341 INFO L140 encePairwiseOnDemand]: 116/120 looper letters, 53 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-03-09 01:20:21,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 113 transitions, 346 flow [2025-03-09 01:20:21,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:20:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:20:21,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2025-03-09 01:20:21,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-03-09 01:20:21,343 INFO L175 Difference]: Start difference. First operand has 105 places, 111 transitions, 232 flow. Second operand 3 states and 252 transitions. [2025-03-09 01:20:21,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 113 transitions, 346 flow [2025-03-09 01:20:21,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 113 transitions, 342 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:21,345 INFO L231 Difference]: Finished difference. Result has 106 places, 112 transitions, 242 flow [2025-03-09 01:20:21,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=106, PETRI_TRANSITIONS=112} [2025-03-09 01:20:21,348 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -8 predicate places. [2025-03-09 01:20:21,348 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 112 transitions, 242 flow [2025-03-09 01:20:21,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 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:20:21,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:21,350 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:20:21,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:20:21,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-09 01:20:21,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:21,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1170614776, now seen corresponding path program 1 times [2025-03-09 01:20:21,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:21,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790250857] [2025-03-09 01:20:21,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:21,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:21,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:20:21,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:20:21,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:21,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:21,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:21,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:21,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790250857] [2025-03-09 01:20:21,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790250857] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:21,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958545134] [2025-03-09 01:20:21,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:21,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:21,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:21,606 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:20:21,608 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:20:21,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:20:21,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:20:21,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:21,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:21,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 01:20:21,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:21,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-09 01:20:21,890 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:20:21,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:21,973 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:20:21,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958545134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:21,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:21,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:20:21,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837948591] [2025-03-09 01:20:21,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:21,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:20:21,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:21,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:20:21,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:20:22,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-09 01:20:22,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 112 transitions, 242 flow. Second operand has 11 states, 11 states have (on average 66.36363636363636) internal successors, (730), 11 states have internal predecessors, (730), 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:20:22,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:22,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-09 01:20:22,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:22,967 INFO L124 PetriNetUnfolderBase]: 2263/4994 cut-off events. [2025-03-09 01:20:22,967 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-09 01:20:22,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8075 conditions, 4994 events. 2263/4994 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40885 event pairs, 1414 based on Foata normal form. 0/3838 useless extension candidates. Maximal degree in co-relation 8062. Up to 3018 conditions per place. [2025-03-09 01:20:22,997 INFO L140 encePairwiseOnDemand]: 113/120 looper letters, 47 selfloop transitions, 7 changer transitions 0/112 dead transitions. [2025-03-09 01:20:22,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 112 transitions, 348 flow [2025-03-09 01:20:22,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:20:22,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:20:22,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 445 transitions. [2025-03-09 01:20:22,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6180555555555556 [2025-03-09 01:20:22,999 INFO L175 Difference]: Start difference. First operand has 106 places, 112 transitions, 242 flow. Second operand 6 states and 445 transitions. [2025-03-09 01:20:22,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 112 transitions, 348 flow [2025-03-09 01:20:23,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 112 transitions, 346 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:20:23,001 INFO L231 Difference]: Finished difference. Result has 110 places, 112 transitions, 258 flow [2025-03-09 01:20:23,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=110, PETRI_TRANSITIONS=112} [2025-03-09 01:20:23,001 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -4 predicate places. [2025-03-09 01:20:23,001 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 112 transitions, 258 flow [2025-03-09 01:20:23,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 66.36363636363636) internal successors, (730), 11 states have internal predecessors, (730), 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:20:23,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:23,005 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:20:23,015 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:20:23,205 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:20:23,206 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-09 01:20:23,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:23,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1929322272, now seen corresponding path program 1 times [2025-03-09 01:20:23,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:23,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408012722] [2025-03-09 01:20:23,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:23,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:23,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:20:23,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:20:23,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:23,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:20:23,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:23,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408012722] [2025-03-09 01:20:23,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408012722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:23,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:23,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:20:23,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143410813] [2025-03-09 01:20:23,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:23,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:20:23,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:23,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:20:23,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:20:23,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-09 01:20:23,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 112 transitions, 258 flow. Second operand has 5 states, 5 states have (on average 66.2) internal successors, (331), 5 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:23,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:23,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-09 01:20:23,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:23,862 INFO L124 PetriNetUnfolderBase]: 2264/4997 cut-off events. [2025-03-09 01:20:23,862 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-09 01:20:23,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8091 conditions, 4997 events. 2264/4997 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40896 event pairs, 1414 based on Foata normal form. 1/3843 useless extension candidates. Maximal degree in co-relation 8062. Up to 3023 conditions per place. [2025-03-09 01:20:23,892 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 52 selfloop transitions, 5 changer transitions 0/115 dead transitions. [2025-03-09 01:20:23,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 115 transitions, 378 flow [2025-03-09 01:20:23,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:20:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:20:23,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 318 transitions. [2025-03-09 01:20:23,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6625 [2025-03-09 01:20:23,894 INFO L175 Difference]: Start difference. First operand has 110 places, 112 transitions, 258 flow. Second operand 4 states and 318 transitions. [2025-03-09 01:20:23,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 115 transitions, 378 flow [2025-03-09 01:20:23,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 115 transitions, 366 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-09 01:20:23,896 INFO L231 Difference]: Finished difference. Result has 111 places, 114 transitions, 271 flow [2025-03-09 01:20:23,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=111, PETRI_TRANSITIONS=114} [2025-03-09 01:20:23,897 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -3 predicate places. [2025-03-09 01:20:23,897 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 114 transitions, 271 flow [2025-03-09 01:20:23,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.2) internal successors, (331), 5 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:23,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:23,897 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:23,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:20:23,897 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-09 01:20:23,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:23,898 INFO L85 PathProgramCache]: Analyzing trace with hash -320547379, now seen corresponding path program 1 times [2025-03-09 01:20:23,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:23,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587798102] [2025-03-09 01:20:23,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:23,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:23,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:20:23,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:20:23,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:23,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:20:23,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:23,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587798102] [2025-03-09 01:20:23,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587798102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:23,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:23,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:20:23,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187932694] [2025-03-09 01:20:23,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:23,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:23,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:23,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:23,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:20:23,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-03-09 01:20:23,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 114 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 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:20:23,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:23,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-03-09 01:20:23,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:24,319 INFO L124 PetriNetUnfolderBase]: 2263/4996 cut-off events. [2025-03-09 01:20:24,320 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-09 01:20:24,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8091 conditions, 4996 events. 2263/4996 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40866 event pairs, 1414 based on Foata normal form. 1/3844 useless extension candidates. Maximal degree in co-relation 8063. Up to 3020 conditions per place. [2025-03-09 01:20:24,349 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 50 selfloop transitions, 4 changer transitions 0/114 dead transitions. [2025-03-09 01:20:24,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 114 transitions, 376 flow [2025-03-09 01:20:24,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:20:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:20:24,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 327 transitions. [2025-03-09 01:20:24,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68125 [2025-03-09 01:20:24,350 INFO L175 Difference]: Start difference. First operand has 111 places, 114 transitions, 271 flow. Second operand 4 states and 327 transitions. [2025-03-09 01:20:24,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 114 transitions, 376 flow [2025-03-09 01:20:24,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 114 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:24,352 INFO L231 Difference]: Finished difference. Result has 112 places, 113 transitions, 270 flow [2025-03-09 01:20:24,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=270, PETRI_PLACES=112, PETRI_TRANSITIONS=113} [2025-03-09 01:20:24,353 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -2 predicate places. [2025-03-09 01:20:24,353 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 113 transitions, 270 flow [2025-03-09 01:20:24,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 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:20:24,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:24,353 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:24,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:20:24,354 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-09 01:20:24,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:24,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1347131331, now seen corresponding path program 1 times [2025-03-09 01:20:24,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:24,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196961016] [2025-03-09 01:20:24,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:24,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:24,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:20:24,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:20:24,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:24,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:24,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:20:24,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:24,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196961016] [2025-03-09 01:20:24,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196961016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:24,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175003603] [2025-03-09 01:20:24,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:24,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:24,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:24,566 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:20:24,568 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:20:24,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:20:24,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:20:24,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:24,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:24,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:20:24,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:24,654 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:20:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:20:24,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:24,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:20:24,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175003603] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:24,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:24,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-09 01:20:24,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525351983] [2025-03-09 01:20:24,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:24,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:20:24,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:24,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:20:24,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:20:25,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-09 01:20:25,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 113 transitions, 270 flow. Second operand has 13 states, 13 states have (on average 66.61538461538461) internal successors, (866), 13 states have internal predecessors, (866), 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:20:25,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:25,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-09 01:20:25,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:26,008 INFO L124 PetriNetUnfolderBase]: 2265/5001 cut-off events. [2025-03-09 01:20:26,008 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-09 01:20:26,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8111 conditions, 5001 events. 2265/5001 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40853 event pairs, 1414 based on Foata normal form. 0/3847 useless extension candidates. Maximal degree in co-relation 8069. Up to 3016 conditions per place. [2025-03-09 01:20:26,035 INFO L140 encePairwiseOnDemand]: 112/120 looper letters, 45 selfloop transitions, 16 changer transitions 0/119 dead transitions. [2025-03-09 01:20:26,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 119 transitions, 417 flow [2025-03-09 01:20:26,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:20:26,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:20:26,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 648 transitions. [2025-03-09 01:20:26,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-09 01:20:26,037 INFO L175 Difference]: Start difference. First operand has 112 places, 113 transitions, 270 flow. Second operand 9 states and 648 transitions. [2025-03-09 01:20:26,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 119 transitions, 417 flow [2025-03-09 01:20:26,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 119 transitions, 407 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:20:26,039 INFO L231 Difference]: Finished difference. Result has 116 places, 119 transitions, 317 flow [2025-03-09 01:20:26,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=317, PETRI_PLACES=116, PETRI_TRANSITIONS=119} [2025-03-09 01:20:26,040 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 2 predicate places. [2025-03-09 01:20:26,040 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 119 transitions, 317 flow [2025-03-09 01:20:26,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 66.61538461538461) internal successors, (866), 13 states have internal predecessors, (866), 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:20:26,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:26,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:26,047 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:20:26,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 01:20:26,241 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-09 01:20:26,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:26,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1188606032, now seen corresponding path program 1 times [2025-03-09 01:20:26,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:26,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758724876] [2025-03-09 01:20:26,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:26,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:26,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:20:26,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:20:26,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:26,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:26,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:20:26,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:26,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758724876] [2025-03-09 01:20:26,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758724876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:26,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:26,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:20:26,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474305730] [2025-03-09 01:20:26,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:26,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:20:26,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:26,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:20:26,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:20:26,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-09 01:20:26,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 119 transitions, 317 flow. Second operand has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 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:20:26,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:26,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-09 01:20:26,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:26,868 INFO L124 PetriNetUnfolderBase]: 2265/5003 cut-off events. [2025-03-09 01:20:26,868 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-09 01:20:26,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8126 conditions, 5003 events. 2265/5003 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40872 event pairs, 1414 based on Foata normal form. 0/3849 useless extension candidates. Maximal degree in co-relation 8080. Up to 3028 conditions per place. [2025-03-09 01:20:26,894 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 58 selfloop transitions, 5 changer transitions 0/121 dead transitions. [2025-03-09 01:20:26,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 121 transitions, 447 flow [2025-03-09 01:20:26,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:20:26,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:20:26,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2025-03-09 01:20:26,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6604166666666667 [2025-03-09 01:20:26,899 INFO L175 Difference]: Start difference. First operand has 116 places, 119 transitions, 317 flow. Second operand 4 states and 317 transitions. [2025-03-09 01:20:26,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 121 transitions, 447 flow [2025-03-09 01:20:26,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 121 transitions, 428 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-09 01:20:26,901 INFO L231 Difference]: Finished difference. Result has 117 places, 120 transitions, 321 flow [2025-03-09 01:20:26,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=321, PETRI_PLACES=117, PETRI_TRANSITIONS=120} [2025-03-09 01:20:26,903 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 3 predicate places. [2025-03-09 01:20:26,903 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 120 transitions, 321 flow [2025-03-09 01:20:26,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 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:20:26,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:26,903 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:26,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:20:26,904 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-09 01:20:26,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:26,906 INFO L85 PathProgramCache]: Analyzing trace with hash -210864714, now seen corresponding path program 1 times [2025-03-09 01:20:26,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:26,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460438231] [2025-03-09 01:20:26,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:26,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:26,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:20:26,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:20:26,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:26,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:27,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:20:27,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:27,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460438231] [2025-03-09 01:20:27,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460438231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:27,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124413930] [2025-03-09 01:20:27,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:27,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:27,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:27,085 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:20:27,087 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:20:27,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:20:27,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:20:27,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:27,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:27,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:20:27,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:27,206 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:20:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:20:27,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:20:27,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124413930] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:27,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:27,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-09 01:20:27,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40571715] [2025-03-09 01:20:27,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:27,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:20:27,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:27,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:20:27,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:20:27,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-09 01:20:27,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 120 transitions, 321 flow. Second operand has 13 states, 13 states have (on average 67.07692307692308) internal successors, (872), 13 states have internal predecessors, (872), 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:20:27,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:27,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-09 01:20:27,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:28,368 INFO L124 PetriNetUnfolderBase]: 2266/5005 cut-off events. [2025-03-09 01:20:28,368 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-09 01:20:28,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8131 conditions, 5005 events. 2266/5005 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40812 event pairs, 1414 based on Foata normal form. 0/3851 useless extension candidates. Maximal degree in co-relation 8086. Up to 3020 conditions per place. [2025-03-09 01:20:28,392 INFO L140 encePairwiseOnDemand]: 111/120 looper letters, 47 selfloop transitions, 18 changer transitions 0/123 dead transitions. [2025-03-09 01:20:28,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 123 transitions, 458 flow [2025-03-09 01:20:28,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:20:28,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:20:28,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 647 transitions. [2025-03-09 01:20:28,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5990740740740741 [2025-03-09 01:20:28,394 INFO L175 Difference]: Start difference. First operand has 117 places, 120 transitions, 321 flow. Second operand 9 states and 647 transitions. [2025-03-09 01:20:28,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 123 transitions, 458 flow [2025-03-09 01:20:28,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 123 transitions, 453 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:28,396 INFO L231 Difference]: Finished difference. Result has 121 places, 123 transitions, 359 flow [2025-03-09 01:20:28,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=359, PETRI_PLACES=121, PETRI_TRANSITIONS=123} [2025-03-09 01:20:28,397 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 7 predicate places. [2025-03-09 01:20:28,397 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 123 transitions, 359 flow [2025-03-09 01:20:28,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 67.07692307692308) internal successors, (872), 13 states have internal predecessors, (872), 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:20:28,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:28,397 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:28,404 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:20:28,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:28,598 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-09 01:20:28,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:28,598 INFO L85 PathProgramCache]: Analyzing trace with hash 2053131108, now seen corresponding path program 1 times [2025-03-09 01:20:28,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:28,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262085421] [2025-03-09 01:20:28,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:28,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:28,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:20:28,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:20:28,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:28,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:28,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:20:28,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:28,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262085421] [2025-03-09 01:20:28,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262085421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:28,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496843350] [2025-03-09 01:20:28,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:28,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:28,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:28,808 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:20:28,810 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:20:28,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:20:28,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:20:28,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:28,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:28,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 01:20:28,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:28,943 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:20:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:20:28,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:20:28,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496843350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:28,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:20:28,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-09 01:20:28,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798636400] [2025-03-09 01:20:28,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:28,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:28,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:28,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:28,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:20:28,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-09 01:20:28,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 123 transitions, 359 flow. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 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:20:28,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:28,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-09 01:20:28,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:29,340 INFO L124 PetriNetUnfolderBase]: 2267/5009 cut-off events. [2025-03-09 01:20:29,341 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-09 01:20:29,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8157 conditions, 5009 events. 2267/5009 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40876 event pairs, 1414 based on Foata normal form. 0/3854 useless extension candidates. Maximal degree in co-relation 8105. Up to 3038 conditions per place. [2025-03-09 01:20:29,370 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 66 selfloop transitions, 5 changer transitions 0/126 dead transitions. [2025-03-09 01:20:29,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 126 transitions, 507 flow [2025-03-09 01:20:29,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:20:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:20:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2025-03-09 01:20:29,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6604166666666667 [2025-03-09 01:20:29,371 INFO L175 Difference]: Start difference. First operand has 121 places, 123 transitions, 359 flow. Second operand 4 states and 317 transitions. [2025-03-09 01:20:29,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 126 transitions, 507 flow [2025-03-09 01:20:29,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 126 transitions, 482 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-09 01:20:29,374 INFO L231 Difference]: Finished difference. Result has 121 places, 125 transitions, 358 flow [2025-03-09 01:20:29,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=358, PETRI_PLACES=121, PETRI_TRANSITIONS=125} [2025-03-09 01:20:29,374 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 7 predicate places. [2025-03-09 01:20:29,374 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 125 transitions, 358 flow [2025-03-09 01:20:29,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 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:20:29,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:29,375 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:29,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:20:29,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:29,579 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-09 01:20:29,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:29,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2053131107, now seen corresponding path program 1 times [2025-03-09 01:20:29,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:29,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619019253] [2025-03-09 01:20:29,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:29,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:29,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:20:29,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:20:29,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:29,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:29,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:20:29,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:29,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619019253] [2025-03-09 01:20:29,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619019253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:29,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:29,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:20:29,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906986301] [2025-03-09 01:20:29,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:29,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:20:29,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:29,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:20:29,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:20:29,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-09 01:20:29,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 125 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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:20:29,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:29,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-09 01:20:29,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:29,923 INFO L124 PetriNetUnfolderBase]: 2267/5005 cut-off events. [2025-03-09 01:20:29,923 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-09 01:20:29,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8147 conditions, 5005 events. 2267/5005 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40850 event pairs, 1414 based on Foata normal form. 2/3855 useless extension candidates. Maximal degree in co-relation 8098. Up to 3026 conditions per place. [2025-03-09 01:20:29,948 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 64 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2025-03-09 01:20:29,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 122 transitions, 486 flow [2025-03-09 01:20:29,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:20:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:20:29,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2025-03-09 01:20:29,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2025-03-09 01:20:29,950 INFO L175 Difference]: Start difference. First operand has 121 places, 125 transitions, 358 flow. Second operand 3 states and 248 transitions. [2025-03-09 01:20:29,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 122 transitions, 486 flow [2025-03-09 01:20:29,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 122 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:29,952 INFO L231 Difference]: Finished difference. Result has 118 places, 122 transitions, 352 flow [2025-03-09 01:20:29,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=118, PETRI_TRANSITIONS=122} [2025-03-09 01:20:29,953 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 4 predicate places. [2025-03-09 01:20:29,953 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 122 transitions, 352 flow [2025-03-09 01:20:29,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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:20:29,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:29,953 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:29,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:20:29,954 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-09 01:20:29,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:29,954 INFO L85 PathProgramCache]: Analyzing trace with hash -777442915, now seen corresponding path program 1 times [2025-03-09 01:20:29,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:29,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667195823] [2025-03-09 01:20:29,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:29,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:29,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:20:29,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:20:29,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:29,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:30,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:20:30,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:30,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667195823] [2025-03-09 01:20:30,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667195823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:30,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:30,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:20:30,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380313588] [2025-03-09 01:20:30,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:30,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:30,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:30,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:30,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:20:30,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-03-09 01:20:30,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 122 transitions, 352 flow. Second operand has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:30,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:30,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-03-09 01:20:30,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:30,315 INFO L124 PetriNetUnfolderBase]: 2266/5004 cut-off events. [2025-03-09 01:20:30,315 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-09 01:20:30,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8144 conditions, 5004 events. 2266/5004 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40854 event pairs, 1414 based on Foata normal form. 1/3854 useless extension candidates. Maximal degree in co-relation 8096. Up to 3034 conditions per place. [2025-03-09 01:20:30,336 INFO L140 encePairwiseOnDemand]: 116/120 looper letters, 63 selfloop transitions, 4 changer transitions 0/122 dead transitions. [2025-03-09 01:20:30,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 122 transitions, 484 flow [2025-03-09 01:20:30,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:20:30,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:20:30,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2025-03-09 01:20:30,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2025-03-09 01:20:30,338 INFO L175 Difference]: Start difference. First operand has 118 places, 122 transitions, 352 flow. Second operand 4 states and 325 transitions. [2025-03-09 01:20:30,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 122 transitions, 484 flow [2025-03-09 01:20:30,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 122 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:30,339 INFO L231 Difference]: Finished difference. Result has 119 places, 121 transitions, 350 flow [2025-03-09 01:20:30,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=350, PETRI_PLACES=119, PETRI_TRANSITIONS=121} [2025-03-09 01:20:30,340 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 5 predicate places. [2025-03-09 01:20:30,340 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 121 transitions, 350 flow [2025-03-09 01:20:30,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:30,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:30,340 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:30,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:20:30,340 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-09 01:20:30,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:30,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1669043914, now seen corresponding path program 1 times [2025-03-09 01:20:30,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:30,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336122516] [2025-03-09 01:20:30,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:30,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:30,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:20:30,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:20:30,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:30,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:20:30,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:30,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336122516] [2025-03-09 01:20:30,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336122516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:30,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212429908] [2025-03-09 01:20:30,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:30,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:30,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:30,423 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:20:30,424 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:20:30,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:20:30,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:20:30,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:30,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:30,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:20:30,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:20:30,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:30,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:20:30,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212429908] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:30,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:30,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-09 01:20:30,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378990463] [2025-03-09 01:20:30,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:30,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:20:30,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:30,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:20:30,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:20:30,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-03-09 01:20:30,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 121 transitions, 350 flow. Second operand has 14 states, 14 states have (on average 70.0) internal successors, (980), 14 states have internal predecessors, (980), 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:20:30,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:30,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-03-09 01:20:30,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:31,359 INFO L124 PetriNetUnfolderBase]: 4460/9788 cut-off events. [2025-03-09 01:20:31,359 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-09 01:20:31,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15944 conditions, 9788 events. 4460/9788 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 89607 event pairs, 2808 based on Foata normal form. 1/7627 useless extension candidates. Maximal degree in co-relation 8089. Up to 3008 conditions per place. [2025-03-09 01:20:31,397 INFO L140 encePairwiseOnDemand]: 108/120 looper letters, 88 selfloop transitions, 34 changer transitions 0/177 dead transitions. [2025-03-09 01:20:31,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 177 transitions, 758 flow [2025-03-09 01:20:31,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:20:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:20:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 782 transitions. [2025-03-09 01:20:31,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6516666666666666 [2025-03-09 01:20:31,399 INFO L175 Difference]: Start difference. First operand has 119 places, 121 transitions, 350 flow. Second operand 10 states and 782 transitions. [2025-03-09 01:20:31,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 177 transitions, 758 flow [2025-03-09 01:20:31,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 177 transitions, 744 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:20:31,401 INFO L231 Difference]: Finished difference. Result has 128 places, 137 transitions, 506 flow [2025-03-09 01:20:31,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=506, PETRI_PLACES=128, PETRI_TRANSITIONS=137} [2025-03-09 01:20:31,402 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 14 predicate places. [2025-03-09 01:20:31,402 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 137 transitions, 506 flow [2025-03-09 01:20:31,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 70.0) internal successors, (980), 14 states have internal predecessors, (980), 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:20:31,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:31,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:31,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:20:31,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-09 01:20:31,607 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-09 01:20:31,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:31,607 INFO L85 PathProgramCache]: Analyzing trace with hash 200755959, now seen corresponding path program 1 times [2025-03-09 01:20:31,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:31,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260981140] [2025-03-09 01:20:31,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:31,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:31,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:20:31,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:20:31,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:31,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:20:31,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:31,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260981140] [2025-03-09 01:20:31,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260981140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:31,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819090119] [2025-03-09 01:20:31,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:31,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:31,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:31,768 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:20:31,778 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:20:31,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:20:31,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:20:31,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:31,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:31,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 01:20:31,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:31,910 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:20:31,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:20:31,914 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:20:31,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819090119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:31,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:20:31,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2025-03-09 01:20:31,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080182437] [2025-03-09 01:20:31,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:31,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:31,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:31,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:31,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:20:31,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-09 01:20:31,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 137 transitions, 506 flow. Second operand has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 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:20:31,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:31,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-09 01:20:31,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:32,566 INFO L124 PetriNetUnfolderBase]: 4530/10002 cut-off events. [2025-03-09 01:20:32,566 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-03-09 01:20:32,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16298 conditions, 10002 events. 4530/10002 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 91853 event pairs, 2828 based on Foata normal form. 0/7699 useless extension candidates. Maximal degree in co-relation 8121. Up to 6070 conditions per place. [2025-03-09 01:20:32,615 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 83 selfloop transitions, 5 changer transitions 0/140 dead transitions. [2025-03-09 01:20:32,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 140 transitions, 688 flow [2025-03-09 01:20:32,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:20:32,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:20:32,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2025-03-09 01:20:32,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6604166666666667 [2025-03-09 01:20:32,617 INFO L175 Difference]: Start difference. First operand has 128 places, 137 transitions, 506 flow. Second operand 4 states and 317 transitions. [2025-03-09 01:20:32,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 140 transitions, 688 flow [2025-03-09 01:20:32,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 140 transitions, 684 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:20:32,620 INFO L231 Difference]: Finished difference. Result has 131 places, 139 transitions, 526 flow [2025-03-09 01:20:32,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=526, PETRI_PLACES=131, PETRI_TRANSITIONS=139} [2025-03-09 01:20:32,620 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 17 predicate places. [2025-03-09 01:20:32,620 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 139 transitions, 526 flow [2025-03-09 01:20:32,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 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:20:32,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:32,621 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:32,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:20:32,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:32,821 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-09 01:20:32,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:32,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1928469381, now seen corresponding path program 1 times [2025-03-09 01:20:32,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:32,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915114735] [2025-03-09 01:20:32,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:32,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:32,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:20:32,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:20:32,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:32,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:20:32,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:32,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915114735] [2025-03-09 01:20:32,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915114735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:32,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:32,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:20:32,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362387620] [2025-03-09 01:20:32,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:32,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:32,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:32,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:32,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:20:32,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-03-09 01:20:32,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 139 transitions, 526 flow. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 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:20:32,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:32,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-03-09 01:20:32,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:33,485 INFO L124 PetriNetUnfolderBase]: 4528/10000 cut-off events. [2025-03-09 01:20:33,485 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-03-09 01:20:33,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16302 conditions, 10000 events. 4528/10000 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 91822 event pairs, 2828 based on Foata normal form. 2/7708 useless extension candidates. Maximal degree in co-relation 8122. Up to 6063 conditions per place. [2025-03-09 01:20:33,538 INFO L140 encePairwiseOnDemand]: 116/120 looper letters, 80 selfloop transitions, 4 changer transitions 0/139 dead transitions. [2025-03-09 01:20:33,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 139 transitions, 691 flow [2025-03-09 01:20:33,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:20:33,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:20:33,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2025-03-09 01:20:33,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2025-03-09 01:20:33,539 INFO L175 Difference]: Start difference. First operand has 131 places, 139 transitions, 526 flow. Second operand 4 states and 325 transitions. [2025-03-09 01:20:33,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 139 transitions, 691 flow [2025-03-09 01:20:33,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 139 transitions, 686 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:33,541 INFO L231 Difference]: Finished difference. Result has 132 places, 138 transitions, 524 flow [2025-03-09 01:20:33,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=524, PETRI_PLACES=132, PETRI_TRANSITIONS=138} [2025-03-09 01:20:33,542 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 18 predicate places. [2025-03-09 01:20:33,542 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 138 transitions, 524 flow [2025-03-09 01:20:33,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 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:20:33,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:33,542 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:33,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:20:33,542 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-09 01:20:33,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:33,543 INFO L85 PathProgramCache]: Analyzing trace with hash 274620724, now seen corresponding path program 2 times [2025-03-09 01:20:33,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:33,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282377533] [2025-03-09 01:20:33,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:33,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:33,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-09 01:20:33,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:20:33,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:33,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:20:33,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:33,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282377533] [2025-03-09 01:20:33,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282377533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:33,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318626323] [2025-03-09 01:20:33,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:33,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:33,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:33,685 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:20:33,686 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:20:33,741 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-09 01:20:33,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:20:33,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:33,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:33,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 01:20:33,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:33,819 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 7 [2025-03-09 01:20:33,880 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:20:33,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:34,064 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:20:34,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318626323] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:34,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:34,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 18 [2025-03-09 01:20:34,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051319024] [2025-03-09 01:20:34,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:34,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:20:34,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:34,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:20:34,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:20:34,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-09 01:20:34,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 138 transitions, 524 flow. Second operand has 20 states, 20 states have (on average 67.3) internal successors, (1346), 20 states have internal predecessors, (1346), 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:20:34,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:34,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-09 01:20:34,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:35,879 INFO L124 PetriNetUnfolderBase]: 6725/14793 cut-off events. [2025-03-09 01:20:35,879 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-03-09 01:20:35,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24167 conditions, 14793 events. 6725/14793 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 143971 event pairs, 4222 based on Foata normal form. 0/11486 useless extension candidates. Maximal degree in co-relation 8134. Up to 6055 conditions per place. [2025-03-09 01:20:35,942 INFO L140 encePairwiseOnDemand]: 112/120 looper letters, 126 selfloop transitions, 27 changer transitions 0/205 dead transitions. [2025-03-09 01:20:35,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 205 transitions, 1097 flow [2025-03-09 01:20:35,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 01:20:35,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-09 01:20:35,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1223 transitions. [2025-03-09 01:20:35,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5995098039215686 [2025-03-09 01:20:35,946 INFO L175 Difference]: Start difference. First operand has 132 places, 138 transitions, 524 flow. Second operand 17 states and 1223 transitions. [2025-03-09 01:20:35,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 205 transitions, 1097 flow [2025-03-09 01:20:35,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 205 transitions, 1083 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:20:35,949 INFO L231 Difference]: Finished difference. Result has 145 places, 150 transitions, 651 flow [2025-03-09 01:20:35,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=651, PETRI_PLACES=145, PETRI_TRANSITIONS=150} [2025-03-09 01:20:35,950 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 31 predicate places. [2025-03-09 01:20:35,950 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 150 transitions, 651 flow [2025-03-09 01:20:35,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 67.3) internal successors, (1346), 20 states have internal predecessors, (1346), 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:20:35,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:35,950 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:35,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 01:20:36,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:36,151 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-09 01:20:36,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:36,152 INFO L85 PathProgramCache]: Analyzing trace with hash -347012561, now seen corresponding path program 1 times [2025-03-09 01:20:36,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:36,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481093661] [2025-03-09 01:20:36,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:36,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:36,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:20:36,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:20:36,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:36,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:20:36,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:36,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481093661] [2025-03-09 01:20:36,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481093661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:36,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003637147] [2025-03-09 01:20:36,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:36,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:36,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:36,266 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:20:36,269 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:20:36,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:20:36,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:20:36,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:36,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:36,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:20:36,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:20:36,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:36,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:20:36,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003637147] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:36,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:36,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-09 01:20:36,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187212643] [2025-03-09 01:20:36,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:36,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:20:36,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:36,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:20:36,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:20:36,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-03-09 01:20:36,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 150 transitions, 651 flow. Second operand has 14 states, 14 states have (on average 70.21428571428571) internal successors, (983), 14 states have internal predecessors, (983), 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:20:36,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:36,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-03-09 01:20:36,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:38,465 INFO L124 PetriNetUnfolderBase]: 13369/29333 cut-off events. [2025-03-09 01:20:38,465 INFO L125 PetriNetUnfolderBase]: For 258/258 co-relation queries the response was YES. [2025-03-09 01:20:38,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47876 conditions, 29333 events. 13369/29333 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 1483. Compared 316741 event pairs, 8424 based on Foata normal form. 3/22874 useless extension candidates. Maximal degree in co-relation 15949. Up to 9042 conditions per place. [2025-03-09 01:20:38,610 INFO L140 encePairwiseOnDemand]: 107/120 looper letters, 119 selfloop transitions, 47 changer transitions 0/220 dead transitions. [2025-03-09 01:20:38,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 220 transitions, 1316 flow [2025-03-09 01:20:38,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:20:38,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:20:38,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 713 transitions. [2025-03-09 01:20:38,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6601851851851852 [2025-03-09 01:20:38,612 INFO L175 Difference]: Start difference. First operand has 145 places, 150 transitions, 651 flow. Second operand 9 states and 713 transitions. [2025-03-09 01:20:38,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 220 transitions, 1316 flow [2025-03-09 01:20:38,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 220 transitions, 1150 flow, removed 30 selfloop flow, removed 7 redundant places. [2025-03-09 01:20:38,616 INFO L231 Difference]: Finished difference. Result has 150 places, 168 transitions, 838 flow [2025-03-09 01:20:38,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=838, PETRI_PLACES=150, PETRI_TRANSITIONS=168} [2025-03-09 01:20:38,617 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 36 predicate places. [2025-03-09 01:20:38,617 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 168 transitions, 838 flow [2025-03-09 01:20:38,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 70.21428571428571) internal successors, (983), 14 states have internal predecessors, (983), 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:20:38,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:38,619 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:38,624 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:20:38,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-09 01:20:38,819 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-09 01:20:38,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:38,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2127514445, now seen corresponding path program 1 times [2025-03-09 01:20:38,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:38,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831310276] [2025-03-09 01:20:38,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:38,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:38,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:20:38,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:20:38,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:38,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:20:38,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:38,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831310276] [2025-03-09 01:20:38,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831310276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:38,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918664714] [2025-03-09 01:20:38,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:38,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:38,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:38,979 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:20:38,981 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:20:39,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:20:39,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:20:39,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:39,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:39,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 01:20:39,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:39,112 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:20:39,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:20:39,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:20:39,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918664714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:39,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:20:39,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2025-03-09 01:20:39,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381496354] [2025-03-09 01:20:39,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:39,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:39,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:39,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:39,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:20:39,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-09 01:20:39,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 168 transitions, 838 flow. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 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:20:39,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:39,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-09 01:20:39,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:41,147 INFO L124 PetriNetUnfolderBase]: 13579/29975 cut-off events. [2025-03-09 01:20:41,147 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2025-03-09 01:20:41,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48831 conditions, 29975 events. 13579/29975 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 1496. Compared 325546 event pairs, 8484 based on Foata normal form. 0/23078 useless extension candidates. Maximal degree in co-relation 16575. Up to 18179 conditions per place. [2025-03-09 01:20:41,372 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 114 selfloop transitions, 5 changer transitions 0/171 dead transitions. [2025-03-09 01:20:41,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 171 transitions, 1082 flow [2025-03-09 01:20:41,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:20:41,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:20:41,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 316 transitions. [2025-03-09 01:20:41,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2025-03-09 01:20:41,374 INFO L175 Difference]: Start difference. First operand has 150 places, 168 transitions, 838 flow. Second operand 4 states and 316 transitions. [2025-03-09 01:20:41,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 171 transitions, 1082 flow [2025-03-09 01:20:41,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 171 transitions, 1080 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-09 01:20:41,378 INFO L231 Difference]: Finished difference. Result has 154 places, 170 transitions, 860 flow [2025-03-09 01:20:41,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=860, PETRI_PLACES=154, PETRI_TRANSITIONS=170} [2025-03-09 01:20:41,378 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 40 predicate places. [2025-03-09 01:20:41,378 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 170 transitions, 860 flow [2025-03-09 01:20:41,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 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:20:41,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:41,379 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:41,386 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:20:41,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 01:20:41,579 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-09 01:20:41,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:41,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1564224270, now seen corresponding path program 2 times [2025-03-09 01:20:41,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:41,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505723731] [2025-03-09 01:20:41,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:41,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:41,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:20:41,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:20:41,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:41,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:41,798 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:20:41,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:41,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505723731] [2025-03-09 01:20:41,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505723731] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:41,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243300607] [2025-03-09 01:20:41,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:41,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:41,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:41,801 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:20:41,803 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:20:41,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:20:41,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:20:41,976 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:41,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:41,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 01:20:41,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:41,990 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 12 treesize of output 11 [2025-03-09 01:20:42,049 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 17 treesize of output 13 [2025-03-09 01:20:42,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:20:42,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 36 [2025-03-09 01:20:42,156 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:20:42,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:42,303 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:20:42,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243300607] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:42,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:42,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2025-03-09 01:20:42,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097817719] [2025-03-09 01:20:42,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:42,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 01:20:42,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:42,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 01:20:42,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:20:43,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 120 [2025-03-09 01:20:43,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 170 transitions, 860 flow. Second operand has 19 states, 19 states have (on average 64.6842105263158) internal successors, (1229), 19 states have internal predecessors, (1229), 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:20:43,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:43,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 120 [2025-03-09 01:20:43,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:46,946 INFO L124 PetriNetUnfolderBase]: 19966/43725 cut-off events. [2025-03-09 01:20:46,946 INFO L125 PetriNetUnfolderBase]: For 422/422 co-relation queries the response was YES. [2025-03-09 01:20:47,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71581 conditions, 43725 events. 19966/43725 cut-off events. For 422/422 co-relation queries the response was YES. Maximal size of possible extension queue 2152. Compared 495368 event pairs, 12606 based on Foata normal form. 0/34239 useless extension candidates. Maximal degree in co-relation 24272. Up to 9045 conditions per place. [2025-03-09 01:20:47,258 INFO L140 encePairwiseOnDemand]: 109/120 looper letters, 191 selfloop transitions, 69 changer transitions 0/312 dead transitions. [2025-03-09 01:20:47,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 312 transitions, 1955 flow [2025-03-09 01:20:47,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 01:20:47,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-09 01:20:47,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1464 transitions. [2025-03-09 01:20:47,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2025-03-09 01:20:47,265 INFO L175 Difference]: Start difference. First operand has 154 places, 170 transitions, 860 flow. Second operand 21 states and 1464 transitions. [2025-03-09 01:20:47,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 312 transitions, 1955 flow [2025-03-09 01:20:47,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 312 transitions, 1942 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:47,270 INFO L231 Difference]: Finished difference. Result has 179 places, 209 transitions, 1381 flow [2025-03-09 01:20:47,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1381, PETRI_PLACES=179, PETRI_TRANSITIONS=209} [2025-03-09 01:20:47,271 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 65 predicate places. [2025-03-09 01:20:47,271 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 209 transitions, 1381 flow [2025-03-09 01:20:47,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 64.6842105263158) internal successors, (1229), 19 states have internal predecessors, (1229), 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:20:47,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:47,272 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:47,278 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:20:47,476 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:20:47,476 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-09 01:20:47,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:47,476 INFO L85 PathProgramCache]: Analyzing trace with hash 136986471, now seen corresponding path program 1 times [2025-03-09 01:20:47,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:47,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277530405] [2025-03-09 01:20:47,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:47,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:47,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:20:47,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:20:47,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:47,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:20:47,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:47,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277530405] [2025-03-09 01:20:47,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277530405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:47,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188702930] [2025-03-09 01:20:47,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:47,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:47,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:47,559 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:20:47,560 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:20:47,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:20:47,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:20:47,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:47,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:47,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:20:47,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:47,689 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:20:47,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:47,731 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:20:47,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188702930] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:47,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:47,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-09 01:20:47,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257306836] [2025-03-09 01:20:47,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:47,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:20:47,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:47,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:20:47,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:20:47,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-03-09 01:20:47,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 209 transitions, 1381 flow. Second operand has 14 states, 14 states have (on average 70.42857142857143) internal successors, (986), 14 states have internal predecessors, (986), 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:20:47,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:47,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-03-09 01:20:47,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:54,767 INFO L124 PetriNetUnfolderBase]: 40096/87930 cut-off events. [2025-03-09 01:20:54,767 INFO L125 PetriNetUnfolderBase]: For 1026/1026 co-relation queries the response was YES. [2025-03-09 01:20:55,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143609 conditions, 87930 events. 40096/87930 cut-off events. For 1026/1026 co-relation queries the response was YES. Maximal size of possible extension queue 4153. Compared 1089435 event pairs, 25272 based on Foata normal form. 9/68571 useless extension candidates. Maximal degree in co-relation 143497. Up to 27126 conditions per place. [2025-03-09 01:20:55,480 INFO L140 encePairwiseOnDemand]: 107/120 looper letters, 162 selfloop transitions, 65 changer transitions 0/281 dead transitions. [2025-03-09 01:20:55,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 281 transitions, 2202 flow [2025-03-09 01:20:55,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:20:55,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:20:55,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 642 transitions. [2025-03-09 01:20:55,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66875 [2025-03-09 01:20:55,485 INFO L175 Difference]: Start difference. First operand has 179 places, 209 transitions, 1381 flow. Second operand 8 states and 642 transitions. [2025-03-09 01:20:55,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 281 transitions, 2202 flow [2025-03-09 01:20:55,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 281 transitions, 2012 flow, removed 36 selfloop flow, removed 10 redundant places. [2025-03-09 01:20:55,492 INFO L231 Difference]: Finished difference. Result has 179 places, 217 transitions, 1491 flow [2025-03-09 01:20:55,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1491, PETRI_PLACES=179, PETRI_TRANSITIONS=217} [2025-03-09 01:20:55,493 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 65 predicate places. [2025-03-09 01:20:55,493 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 217 transitions, 1491 flow [2025-03-09 01:20:55,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 70.42857142857143) internal successors, (986), 14 states have internal predecessors, (986), 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:20:55,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:55,494 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:55,500 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:20:55,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:55,694 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-09 01:20:55,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:55,696 INFO L85 PathProgramCache]: Analyzing trace with hash 137130916, now seen corresponding path program 1 times [2025-03-09 01:20:55,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:55,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729035098] [2025-03-09 01:20:55,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:55,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:55,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:20:55,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:20:55,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:55,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:55,752 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 01:20:55,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:55,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729035098] [2025-03-09 01:20:55,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729035098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:55,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:55,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:20:55,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031961076] [2025-03-09 01:20:55,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:55,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:55,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:55,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:55,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:20:55,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-03-09 01:20:55,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 217 transitions, 1491 flow. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 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:20:55,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:55,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-03-09 01:20:55,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:02,603 INFO L124 PetriNetUnfolderBase]: 40690/89784 cut-off events. [2025-03-09 01:21:02,603 INFO L125 PetriNetUnfolderBase]: For 985/985 co-relation queries the response was YES. [2025-03-09 01:21:03,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146214 conditions, 89784 events. 40690/89784 cut-off events. For 985/985 co-relation queries the response was YES. Maximal size of possible extension queue 4175. Compared 1119479 event pairs, 25452 based on Foata normal form. 18/69174 useless extension candidates. Maximal degree in co-relation 146113. Up to 54369 conditions per place. [2025-03-09 01:21:03,592 INFO L140 encePairwiseOnDemand]: 116/120 looper letters, 149 selfloop transitions, 13 changer transitions 0/216 dead transitions. [2025-03-09 01:21:03,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 216 transitions, 1805 flow [2025-03-09 01:21:03,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:21:03,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:21:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2025-03-09 01:21:03,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2025-03-09 01:21:03,594 INFO L175 Difference]: Start difference. First operand has 179 places, 217 transitions, 1491 flow. Second operand 4 states and 325 transitions. [2025-03-09 01:21:03,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 216 transitions, 1805 flow [2025-03-09 01:21:03,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 216 transitions, 1728 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:03,600 INFO L231 Difference]: Finished difference. Result has 180 places, 215 transitions, 1426 flow [2025-03-09 01:21:03,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=1400, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1426, PETRI_PLACES=180, PETRI_TRANSITIONS=215} [2025-03-09 01:21:03,600 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 66 predicate places. [2025-03-09 01:21:03,600 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 215 transitions, 1426 flow [2025-03-09 01:21:03,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 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:03,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:03,601 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:03,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 01:21:03,601 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-09 01:21:03,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:03,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1499805378, now seen corresponding path program 1 times [2025-03-09 01:21:03,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:03,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408497925] [2025-03-09 01:21:03,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:03,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:03,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:21:03,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:21:03,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:03,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:04,095 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:21:04,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:04,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408497925] [2025-03-09 01:21:04,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408497925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:04,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428045881] [2025-03-09 01:21:04,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:04,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:04,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:04,097 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:21:04,099 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:21:04,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:21:04,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:21:04,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:04,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:04,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-09 01:21:04,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:04,214 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:21:04,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:21:04,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 01:21:04,292 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-09 01:21:04,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-09 01:21:04,362 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-09 01:21:04,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-03-09 01:21:04,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 01:21:04,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:21:04,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:21:04,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-09 01:21:04,510 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-03-09 01:21:04,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-03-09 01:21:04,665 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-09 01:21:04,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-09 01:21:04,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-09 01:21:04,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:21:04,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:21:04,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-09 01:21:04,798 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2025-03-09 01:21:04,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2025-03-09 01:21:04,853 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:21:04,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:05,607 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 4738 treesize of output 4704 [2025-03-09 01:21:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:21:06,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428045881] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:06,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:06,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-03-09 01:21:06,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678700623] [2025-03-09 01:21:06,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:06,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:21:06,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:06,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:21:06,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:21:08,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 120 [2025-03-09 01:21:08,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 215 transitions, 1426 flow. Second operand has 23 states, 23 states have (on average 57.73913043478261) internal successors, (1328), 23 states have internal predecessors, (1328), 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:08,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:08,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 120 [2025-03-09 01:21:08,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:13,545 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:21:21,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-09 01:21:25,977 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:21:50,102 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 [0, 1]