./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 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/loop-tiling-eq.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 2c579ed20cf5b381709dcc4ef9fbcf839f80c68ac017a29b947b11bd3a57dd56 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:24:39,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:24:40,003 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:24:40,006 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:24:40,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:24:40,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:24:40,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:24:40,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:24:40,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:24:40,026 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:24:40,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:24:40,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:24:40,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:24:40,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:24:40,027 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:24:40,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:24:40,027 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:24:40,027 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:24:40,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:24:40,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:24:40,027 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:24:40,028 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:24:40,028 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:24:40,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:24:40,028 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:24:40,028 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:24:40,028 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:24:40,028 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:24:40,028 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:24:40,029 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:24:40,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:24:40,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:24:40,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:24:40,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:24:40,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:24:40,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:24:40,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:24:40,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:24:40,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:24:40,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:24:40,029 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:24:40,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:24:40,029 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 -> 2c579ed20cf5b381709dcc4ef9fbcf839f80c68ac017a29b947b11bd3a57dd56 [2025-03-17 14:24:40,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:24:40,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:24:40,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:24:40,241 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:24:40,241 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:24:40,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2025-03-17 14:24:41,394 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9db92b478/6debbc2b660a4c509d2ad434c625e7d2/FLAG0ac7e1144 [2025-03-17 14:24:41,581 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:24:41,581 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2025-03-17 14:24:41,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9db92b478/6debbc2b660a4c509d2ad434c625e7d2/FLAG0ac7e1144 [2025-03-17 14:24:41,952 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9db92b478/6debbc2b660a4c509d2ad434c625e7d2 [2025-03-17 14:24:41,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:24:41,955 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:24:41,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:24:41,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:24:41,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:24:41,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:24:41" (1/1) ... [2025-03-17 14:24:41,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6560b0e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:41, skipping insertion in model container [2025-03-17 14:24:41,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:24:41" (1/1) ... [2025-03-17 14:24:41,974 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:24:42,100 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-17 14:24:42,112 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-17 14:24:42,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:24:42,130 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:24:42,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:24:42,169 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:24:42,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:42 WrapperNode [2025-03-17 14:24:42,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:24:42,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:24:42,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:24:42,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:24:42,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:42" (1/1) ... [2025-03-17 14:24:42,181 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:42" (1/1) ... [2025-03-17 14:24:42,200 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 174 [2025-03-17 14:24:42,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:24:42,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:24:42,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:24:42,201 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:24:42,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:42" (1/1) ... [2025-03-17 14:24:42,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:42" (1/1) ... [2025-03-17 14:24:42,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:42" (1/1) ... [2025-03-17 14:24:42,225 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 9, 3]. 64 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, 5, 1]. [2025-03-17 14:24:42,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:42" (1/1) ... [2025-03-17 14:24:42,225 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:42" (1/1) ... [2025-03-17 14:24:42,237 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:42" (1/1) ... [2025-03-17 14:24:42,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:42" (1/1) ... [2025-03-17 14:24:42,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:42" (1/1) ... [2025-03-17 14:24:42,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:42" (1/1) ... [2025-03-17 14:24:42,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:24:42,248 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:24:42,248 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:24:42,248 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:24:42,250 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:42" (1/1) ... [2025-03-17 14:24:42,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:24:42,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:24:42,272 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-17 14:24:42,276 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-17 14:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 14:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 14:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 14:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 14:24:42,289 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 14:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 14:24:42,289 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 14:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 14:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 14:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 14:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 14:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 14:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:24:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:24:42,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:24:42,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:24:42,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:24:42,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 14:24:42,291 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:24:42,371 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:24:42,373 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:24:42,698 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:24:42,698 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:24:42,869 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:24:42,869 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:24:42,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:24:42 BoogieIcfgContainer [2025-03-17 14:24:42,869 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:24:42,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:24:42,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:24:42,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:24:42,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:24:41" (1/3) ... [2025-03-17 14:24:42,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e2180d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:24:42, skipping insertion in model container [2025-03-17 14:24:42,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:24:42" (2/3) ... [2025-03-17 14:24:42,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e2180d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:24:42, skipping insertion in model container [2025-03-17 14:24:42,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:24:42" (3/3) ... [2025-03-17 14:24:42,876 INFO L128 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2025-03-17 14:24:42,887 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:24:42,888 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG loop-tiling-eq.wvr.c that has 3 procedures, 60 locations, 1 initial locations, 7 loop locations, and 26 error locations. [2025-03-17 14:24:42,889 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:24:42,960 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 14:24:42,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 66 transitions, 146 flow [2025-03-17 14:24:43,011 INFO L124 PetriNetUnfolderBase]: 7/64 cut-off events. [2025-03-17 14:24:43,013 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:24:43,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 64 events. 7/64 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 163 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-03-17 14:24:43,017 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 66 transitions, 146 flow [2025-03-17 14:24:43,019 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 63 transitions, 138 flow [2025-03-17 14:24:43,028 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:24:43,038 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;@36c7186a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:24:43,038 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-17 14:24:43,043 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:24:43,044 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:24:43,044 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:24:43,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:43,044 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:24:43,045 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-17 14:24:43,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:43,048 INFO L85 PathProgramCache]: Analyzing trace with hash 614577, now seen corresponding path program 1 times [2025-03-17 14:24:43,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:43,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197716476] [2025-03-17 14:24:43,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:43,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:43,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:24:43,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:24:43,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:43,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:43,263 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-17 14:24:43,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:43,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197716476] [2025-03-17 14:24:43,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197716476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:43,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:43,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:24:43,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441709692] [2025-03-17 14:24:43,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:43,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:24:43,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:43,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:24:43,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:24:43,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-17 14:24:43,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:43,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:43,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-17 14:24:43,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:43,422 INFO L124 PetriNetUnfolderBase]: 58/178 cut-off events. [2025-03-17 14:24:43,423 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-17 14:24:43,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 178 events. 58/178 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 689 event pairs, 30 based on Foata normal form. 1/126 useless extension candidates. Maximal degree in co-relation 222. Up to 96 conditions per place. [2025-03-17 14:24:43,425 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 25 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-03-17 14:24:43,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 186 flow [2025-03-17 14:24:43,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:24:43,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:24:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2025-03-17 14:24:43,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-03-17 14:24:43,436 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 138 flow. Second operand 3 states and 129 transitions. [2025-03-17 14:24:43,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 186 flow [2025-03-17 14:24:43,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 58 transitions, 178 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:24:43,443 INFO L231 Difference]: Finished difference. Result has 56 places, 58 transitions, 128 flow [2025-03-17 14:24:43,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=56, PETRI_TRANSITIONS=58} [2025-03-17 14:24:43,449 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -7 predicate places. [2025-03-17 14:24:43,450 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 128 flow [2025-03-17 14:24:43,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:43,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:43,450 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:24:43,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:24:43,451 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-17 14:24:43,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:43,452 INFO L85 PathProgramCache]: Analyzing trace with hash 614578, now seen corresponding path program 1 times [2025-03-17 14:24:43,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:43,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978817652] [2025-03-17 14:24:43,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:43,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:43,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:24:43,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:24:43,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:43,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:24:43,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1877017989] [2025-03-17 14:24:43,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:43,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:43,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:24:43,494 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:24:43,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:24:43,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:24:43,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:24:43,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:43,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:43,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:24:43,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:24:43,685 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-17 14:24:43,933 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-17 14:24:43,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:24:43,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:43,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978817652] [2025-03-17 14:24:43,934 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:24:43,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877017989] [2025-03-17 14:24:43,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877017989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:43,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:43,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:24:43,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769477918] [2025-03-17 14:24:43,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:43,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:24:43,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:43,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:24:43,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:24:44,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-17 14:24:44,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 58 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-17 14:24:44,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:44,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-17 14:24:44,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:45,209 INFO L124 PetriNetUnfolderBase]: 59/181 cut-off events. [2025-03-17 14:24:45,209 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:24:45,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 181 events. 59/181 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 702 event pairs, 30 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 257. Up to 109 conditions per place. [2025-03-17 14:24:45,211 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 31 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2025-03-17 14:24:45,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 204 flow [2025-03-17 14:24:45,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:24:45,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:24:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2025-03-17 14:24:45,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2025-03-17 14:24:45,212 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 128 flow. Second operand 4 states and 164 transitions. [2025-03-17 14:24:45,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 204 flow [2025-03-17 14:24:45,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 61 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:24:45,214 INFO L231 Difference]: Finished difference. Result has 59 places, 61 transitions, 147 flow [2025-03-17 14:24:45,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=59, PETRI_TRANSITIONS=61} [2025-03-17 14:24:45,215 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -4 predicate places. [2025-03-17 14:24:45,215 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 61 transitions, 147 flow [2025-03-17 14:24:45,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-17 14:24:45,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:45,215 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 14:24:45,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:24:45,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:45,420 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-17 14:24:45,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:45,421 INFO L85 PathProgramCache]: Analyzing trace with hash 19054156, now seen corresponding path program 1 times [2025-03-17 14:24:45,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:45,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052931663] [2025-03-17 14:24:45,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:45,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:45,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:24:45,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:24:45,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:45,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:45,538 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-17 14:24:45,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:45,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052931663] [2025-03-17 14:24:45,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052931663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:45,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:45,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:24:45,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757526919] [2025-03-17 14:24:45,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:45,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:24:45,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:45,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:24:45,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:24:45,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2025-03-17 14:24:45,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 61 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-17 14:24:45,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:45,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2025-03-17 14:24:45,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:45,639 INFO L124 PetriNetUnfolderBase]: 60/186 cut-off events. [2025-03-17 14:24:45,639 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:24:45,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 186 events. 60/186 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 740 event pairs, 30 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 279. Up to 107 conditions per place. [2025-03-17 14:24:45,640 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 29 selfloop transitions, 7 changer transitions 0/65 dead transitions. [2025-03-17 14:24:45,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 65 transitions, 227 flow [2025-03-17 14:24:45,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:24:45,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:24:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2025-03-17 14:24:45,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6704545454545454 [2025-03-17 14:24:45,642 INFO L175 Difference]: Start difference. First operand has 59 places, 61 transitions, 147 flow. Second operand 4 states and 177 transitions. [2025-03-17 14:24:45,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 65 transitions, 227 flow [2025-03-17 14:24:45,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 65 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:24:45,643 INFO L231 Difference]: Finished difference. Result has 63 places, 64 transitions, 178 flow [2025-03-17 14:24:45,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=63, PETRI_TRANSITIONS=64} [2025-03-17 14:24:45,644 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 0 predicate places. [2025-03-17 14:24:45,644 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 64 transitions, 178 flow [2025-03-17 14:24:45,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-17 14:24:45,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:45,644 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:24:45,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:24:45,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-17 14:24:45,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:45,646 INFO L85 PathProgramCache]: Analyzing trace with hash 590628216, now seen corresponding path program 1 times [2025-03-17 14:24:45,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:45,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161883768] [2025-03-17 14:24:45,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:45,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:45,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:24:45,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:24:45,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:45,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:24:45,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [925131257] [2025-03-17 14:24:45,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:45,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:45,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:24:45,677 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-17 14:24:45,679 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-17 14:24:45,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:24:45,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:24:45,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:45,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:45,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 14:24:45,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:24:45,753 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-17 14:24:46,463 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-17 14:24:46,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:24:46,570 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-17 14:24:46,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:46,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161883768] [2025-03-17 14:24:46,571 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:24:46,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925131257] [2025-03-17 14:24:46,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925131257] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:24:46,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:24:46,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2025-03-17 14:24:46,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067337829] [2025-03-17 14:24:46,571 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 14:24:46,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:24:46,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:46,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:24:46,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:24:47,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-17 14:24:47,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 64 transitions, 178 flow. Second operand has 8 states, 8 states have (on average 33.25) internal successors, (266), 8 states have internal predecessors, (266), 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-17 14:24:47,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:47,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-17 14:24:47,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:48,048 INFO L124 PetriNetUnfolderBase]: 60/185 cut-off events. [2025-03-17 14:24:48,049 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:24:48,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 185 events. 60/185 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 723 event pairs, 30 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 284. Up to 110 conditions per place. [2025-03-17 14:24:48,050 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 30 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2025-03-17 14:24:48,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 248 flow [2025-03-17 14:24:48,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:24:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:24:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 227 transitions. [2025-03-17 14:24:48,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5732323232323232 [2025-03-17 14:24:48,051 INFO L175 Difference]: Start difference. First operand has 63 places, 64 transitions, 178 flow. Second operand 6 states and 227 transitions. [2025-03-17 14:24:48,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 248 flow [2025-03-17 14:24:48,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 248 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:24:48,053 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 188 flow [2025-03-17 14:24:48,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2025-03-17 14:24:48,053 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 4 predicate places. [2025-03-17 14:24:48,053 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 188 flow [2025-03-17 14:24:48,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 33.25) internal successors, (266), 8 states have internal predecessors, (266), 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-17 14:24:48,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:48,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:24:48,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:24:48,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 14:24:48,254 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-17 14:24:48,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:48,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1129607750, now seen corresponding path program 1 times [2025-03-17 14:24:48,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:48,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150084344] [2025-03-17 14:24:48,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:48,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:48,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:24:48,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:24:48,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:48,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:48,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:24:48,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:48,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150084344] [2025-03-17 14:24:48,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150084344] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:24:48,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117340682] [2025-03-17 14:24:48,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:48,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:48,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:24:48,446 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-17 14:24:48,447 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-17 14:24:48,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:24:48,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:24:48,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:48,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:48,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 14:24:48,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:24:48,506 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-17 14:24:48,572 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 14:24:48,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2025-03-17 14:24:48,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:24:48,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:24:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:24:48,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117340682] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:24:48,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:24:48,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 10 [2025-03-17 14:24:48,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136568593] [2025-03-17 14:24:48,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:48,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:24:48,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:48,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:24:48,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:24:48,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-17 14:24:48,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:48,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:48,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-17 14:24:48,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:48,889 INFO L124 PetriNetUnfolderBase]: 115/353 cut-off events. [2025-03-17 14:24:48,890 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 14:24:48,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 353 events. 115/353 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1793 event pairs, 60 based on Foata normal form. 1/251 useless extension candidates. Maximal degree in co-relation 304. Up to 107 conditions per place. [2025-03-17 14:24:48,891 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 55 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2025-03-17 14:24:48,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 87 transitions, 364 flow [2025-03-17 14:24:48,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:24:48,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:24:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 222 transitions. [2025-03-17 14:24:48,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6727272727272727 [2025-03-17 14:24:48,894 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 188 flow. Second operand 5 states and 222 transitions. [2025-03-17 14:24:48,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 87 transitions, 364 flow [2025-03-17 14:24:48,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 87 transitions, 334 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-17 14:24:48,897 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 175 flow [2025-03-17 14:24:48,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2025-03-17 14:24:48,898 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2025-03-17 14:24:48,898 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 175 flow [2025-03-17 14:24:48,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:48,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:48,899 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:24:48,906 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-17 14:24:49,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:49,100 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-17 14:24:49,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:49,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1131210892, now seen corresponding path program 1 times [2025-03-17 14:24:49,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:49,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831301599] [2025-03-17 14:24:49,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:49,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:49,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:24:49,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:24:49,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:49,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:49,235 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-17 14:24:49,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:49,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831301599] [2025-03-17 14:24:49,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831301599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:49,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:49,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:24:49,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723962276] [2025-03-17 14:24:49,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:49,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:24:49,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:49,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:24:49,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:24:49,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-17 14:24:49,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:49,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:49,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-17 14:24:49,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:49,413 INFO L124 PetriNetUnfolderBase]: 117/359 cut-off events. [2025-03-17 14:24:49,413 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 14:24:49,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 359 events. 117/359 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1832 event pairs, 60 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 302. Up to 211 conditions per place. [2025-03-17 14:24:49,415 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 32 selfloop transitions, 8 changer transitions 0/66 dead transitions. [2025-03-17 14:24:49,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 261 flow [2025-03-17 14:24:49,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:24:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:24:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 198 transitions. [2025-03-17 14:24:49,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-17 14:24:49,416 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 175 flow. Second operand 5 states and 198 transitions. [2025-03-17 14:24:49,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 261 flow [2025-03-17 14:24:49,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 66 transitions, 246 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:24:49,417 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 200 flow [2025-03-17 14:24:49,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2025-03-17 14:24:49,418 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 4 predicate places. [2025-03-17 14:24:49,418 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 200 flow [2025-03-17 14:24:49,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:49,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:49,418 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:24:49,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:24:49,419 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-17 14:24:49,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:49,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1131210867, now seen corresponding path program 1 times [2025-03-17 14:24:49,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:49,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528660984] [2025-03-17 14:24:49,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:49,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:49,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:24:49,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:24:49,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:49,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:49,499 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-17 14:24:49,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:49,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528660984] [2025-03-17 14:24:49,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528660984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:49,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:49,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:24:49,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990860511] [2025-03-17 14:24:49,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:49,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:24:49,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:49,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:24:49,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:24:49,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2025-03-17 14:24:49,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-17 14:24:49,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:49,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2025-03-17 14:24:49,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:49,579 INFO L124 PetriNetUnfolderBase]: 71/190 cut-off events. [2025-03-17 14:24:49,579 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 14:24:49,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 190 events. 71/190 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 676 event pairs, 38 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 335. Up to 121 conditions per place. [2025-03-17 14:24:49,581 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 37 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2025-03-17 14:24:49,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 274 flow [2025-03-17 14:24:49,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:24:49,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:24:49,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2025-03-17 14:24:49,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6262626262626263 [2025-03-17 14:24:49,582 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 200 flow. Second operand 3 states and 124 transitions. [2025-03-17 14:24:49,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 274 flow [2025-03-17 14:24:49,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:24:49,583 INFO L231 Difference]: Finished difference. Result has 64 places, 63 transitions, 194 flow [2025-03-17 14:24:49,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=64, PETRI_TRANSITIONS=63} [2025-03-17 14:24:49,584 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 1 predicate places. [2025-03-17 14:24:49,584 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 194 flow [2025-03-17 14:24:49,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-17 14:24:49,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:49,584 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:24:49,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:24:49,584 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-17 14:24:49,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:49,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1131210868, now seen corresponding path program 1 times [2025-03-17 14:24:49,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:49,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305506314] [2025-03-17 14:24:49,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:49,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:49,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:24:49,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:24:49,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:49,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:49,791 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-17 14:24:49,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:49,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305506314] [2025-03-17 14:24:49,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305506314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:49,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:49,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:24:49,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186728364] [2025-03-17 14:24:49,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:49,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:24:49,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:49,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:24:49,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:24:49,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-17 14:24:49,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 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-17 14:24:49,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:49,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-17 14:24:49,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:50,069 INFO L124 PetriNetUnfolderBase]: 74/200 cut-off events. [2025-03-17 14:24:50,069 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 14:24:50,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 200 events. 74/200 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 739 event pairs, 38 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 361. Up to 132 conditions per place. [2025-03-17 14:24:50,071 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 41 selfloop transitions, 9 changer transitions 0/72 dead transitions. [2025-03-17 14:24:50,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 72 transitions, 328 flow [2025-03-17 14:24:50,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:24:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:24:50,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 231 transitions. [2025-03-17 14:24:50,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-17 14:24:50,072 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 194 flow. Second operand 6 states and 231 transitions. [2025-03-17 14:24:50,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 72 transitions, 328 flow [2025-03-17 14:24:50,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 72 transitions, 325 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:24:50,074 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 248 flow [2025-03-17 14:24:50,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2025-03-17 14:24:50,074 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 8 predicate places. [2025-03-17 14:24:50,074 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 248 flow [2025-03-17 14:24:50,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 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-17 14:24:50,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:50,075 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:24:50,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:24:50,075 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-17 14:24:50,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:50,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1073658509, now seen corresponding path program 1 times [2025-03-17 14:24:50,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:50,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616466042] [2025-03-17 14:24:50,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:50,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:50,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:24:50,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:24:50,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:50,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:50,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:24:50,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:50,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616466042] [2025-03-17 14:24:50,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616466042] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:24:50,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168345081] [2025-03-17 14:24:50,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:50,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:50,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:24:50,166 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-17 14:24:50,168 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-17 14:24:50,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:24:50,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:24:50,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:50,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:50,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 14:24:50,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:24:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:24:50,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:24:50,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:24:50,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168345081] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:24:50,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:24:50,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-17 14:24:50,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276351555] [2025-03-17 14:24:50,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:24:50,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:24:50,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:50,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:24:50,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:24:50,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2025-03-17 14:24:50,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 248 flow. Second operand has 13 states, 13 states have (on average 36.53846153846154) internal successors, (475), 13 states have internal predecessors, (475), 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-17 14:24:50,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:50,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2025-03-17 14:24:50,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:50,581 INFO L124 PetriNetUnfolderBase]: 121/355 cut-off events. [2025-03-17 14:24:50,581 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-17 14:24:50,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 355 events. 121/355 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1701 event pairs, 60 based on Foata normal form. 1/275 useless extension candidates. Maximal degree in co-relation 601. Up to 112 conditions per place. [2025-03-17 14:24:50,583 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 49 selfloop transitions, 23 changer transitions 0/97 dead transitions. [2025-03-17 14:24:50,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 97 transitions, 499 flow [2025-03-17 14:24:50,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:24:50,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:24:50,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 380 transitions. [2025-03-17 14:24:50,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6397306397306397 [2025-03-17 14:24:50,587 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 248 flow. Second operand 9 states and 380 transitions. [2025-03-17 14:24:50,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 97 transitions, 499 flow [2025-03-17 14:24:50,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 97 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:24:50,590 INFO L231 Difference]: Finished difference. Result has 80 places, 78 transitions, 373 flow [2025-03-17 14:24:50,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=373, PETRI_PLACES=80, PETRI_TRANSITIONS=78} [2025-03-17 14:24:50,591 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 17 predicate places. [2025-03-17 14:24:50,592 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 78 transitions, 373 flow [2025-03-17 14:24:50,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 36.53846153846154) internal successors, (475), 13 states have internal predecessors, (475), 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-17 14:24:50,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:50,592 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:24:50,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:24:50,792 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-17 14:24:50,793 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-17 14:24:50,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:50,793 INFO L85 PathProgramCache]: Analyzing trace with hash 466960186, now seen corresponding path program 1 times [2025-03-17 14:24:50,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:50,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745103601] [2025-03-17 14:24:50,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:50,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:50,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:24:50,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:24:50,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:50,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:50,981 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-17 14:24:50,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:50,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745103601] [2025-03-17 14:24:50,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745103601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:24:50,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735515180] [2025-03-17 14:24:50,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:50,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:50,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:24:50,984 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-17 14:24:50,985 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-17 14:24:51,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:24:51,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:24:51,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:51,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:51,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 14:24:51,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:24:51,082 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-17 14:24:51,206 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-17 14:24:51,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:24:51,324 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-17 14:24:51,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735515180] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:24:51,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:24:51,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-17 14:24:51,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972747899] [2025-03-17 14:24:51,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:24:51,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:24:51,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:51,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:24:51,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:24:51,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-17 14:24:51,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 78 transitions, 373 flow. Second operand has 13 states, 13 states have (on average 33.61538461538461) internal successors, (437), 13 states have internal predecessors, (437), 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-17 14:24:51,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:51,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-17 14:24:51,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:52,010 INFO L124 PetriNetUnfolderBase]: 121/353 cut-off events. [2025-03-17 14:24:52,010 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-17 14:24:52,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 353 events. 121/353 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1688 event pairs, 60 based on Foata normal form. 2/273 useless extension candidates. Maximal degree in co-relation 643. Up to 210 conditions per place. [2025-03-17 14:24:52,012 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 33 selfloop transitions, 21 changer transitions 0/77 dead transitions. [2025-03-17 14:24:52,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 77 transitions, 477 flow [2025-03-17 14:24:52,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:24:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:24:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 261 transitions. [2025-03-17 14:24:52,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.564935064935065 [2025-03-17 14:24:52,013 INFO L175 Difference]: Start difference. First operand has 80 places, 78 transitions, 373 flow. Second operand 7 states and 261 transitions. [2025-03-17 14:24:52,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 77 transitions, 477 flow [2025-03-17 14:24:52,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 77 transitions, 445 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-17 14:24:52,016 INFO L231 Difference]: Finished difference. Result has 82 places, 77 transitions, 379 flow [2025-03-17 14:24:52,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=379, PETRI_PLACES=82, PETRI_TRANSITIONS=77} [2025-03-17 14:24:52,017 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 19 predicate places. [2025-03-17 14:24:52,017 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 77 transitions, 379 flow [2025-03-17 14:24:52,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 33.61538461538461) internal successors, (437), 13 states have internal predecessors, (437), 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-17 14:24:52,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:52,017 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:24:52,024 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-17 14:24:52,217 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,SelfDestructingSolverStorable9 [2025-03-17 14:24:52,218 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-17 14:24:52,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:52,218 INFO L85 PathProgramCache]: Analyzing trace with hash 468367783, now seen corresponding path program 1 times [2025-03-17 14:24:52,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:52,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325871817] [2025-03-17 14:24:52,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:52,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:52,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:24:52,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:24:52,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:52,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:52,276 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-17 14:24:52,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:52,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325871817] [2025-03-17 14:24:52,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325871817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:24:52,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:24:52,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:24:52,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248730706] [2025-03-17 14:24:52,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:24:52,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:24:52,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:52,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:24:52,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:24:52,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-17 14:24:52,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 77 transitions, 379 flow. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:52,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:52,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-17 14:24:52,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:52,466 INFO L124 PetriNetUnfolderBase]: 245/706 cut-off events. [2025-03-17 14:24:52,466 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-17 14:24:52,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 706 events. 245/706 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4127 event pairs, 120 based on Foata normal form. 0/524 useless extension candidates. Maximal degree in co-relation 783. Up to 269 conditions per place. [2025-03-17 14:24:52,470 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 80 selfloop transitions, 12 changer transitions 0/115 dead transitions. [2025-03-17 14:24:52,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 115 transitions, 734 flow [2025-03-17 14:24:52,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:24:52,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:24:52,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 271 transitions. [2025-03-17 14:24:52,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6843434343434344 [2025-03-17 14:24:52,471 INFO L175 Difference]: Start difference. First operand has 82 places, 77 transitions, 379 flow. Second operand 6 states and 271 transitions. [2025-03-17 14:24:52,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 115 transitions, 734 flow [2025-03-17 14:24:52,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 115 transitions, 661 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-17 14:24:52,474 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 375 flow [2025-03-17 14:24:52,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=375, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2025-03-17 14:24:52,475 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 20 predicate places. [2025-03-17 14:24:52,475 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 375 flow [2025-03-17 14:24:52,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:24:52,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:52,477 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-17 14:24:52,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:24:52,477 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-17 14:24:52,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:52,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1590142312, now seen corresponding path program 1 times [2025-03-17 14:24:52,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:52,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120589608] [2025-03-17 14:24:52,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:52,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:52,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:24:52,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:24:52,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:52,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:52,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:24:52,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:52,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120589608] [2025-03-17 14:24:52,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120589608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:24:52,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356206359] [2025-03-17 14:24:52,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:24:52,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:52,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:24:52,750 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-17 14:24:52,751 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-17 14:24:52,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:24:52,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:24:52,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:24:52,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:52,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 14:24:52,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:24:52,839 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-17 14:24:52,848 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-17 14:24:52,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:24:52,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 14:24:52,882 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:24:52,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:24:52,970 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:24:52,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:24:52,975 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 21 treesize of output 14 [2025-03-17 14:24:53,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:24:53,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:24:53,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:24:53,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-03-17 14:24:53,266 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 14:24:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:24:53,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356206359] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:24:53,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:24:53,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-03-17 14:24:53,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556189501] [2025-03-17 14:24:53,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:24:53,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 14:24:53,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:53,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 14:24:53,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-03-17 14:24:54,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2025-03-17 14:24:54,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 375 flow. Second operand has 18 states, 18 states have (on average 27.5) internal successors, (495), 18 states have internal predecessors, (495), 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-17 14:24:54,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:24:54,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2025-03-17 14:24:54,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:24:54,539 INFO L124 PetriNetUnfolderBase]: 249/760 cut-off events. [2025-03-17 14:24:54,539 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2025-03-17 14:24:54,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1582 conditions, 760 events. 249/760 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4852 event pairs, 152 based on Foata normal form. 0/592 useless extension candidates. Maximal degree in co-relation 833. Up to 435 conditions per place. [2025-03-17 14:24:54,543 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 45 selfloop transitions, 16 changer transitions 0/82 dead transitions. [2025-03-17 14:24:54,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 82 transitions, 521 flow [2025-03-17 14:24:54,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:24:54,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:24:54,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 246 transitions. [2025-03-17 14:24:54,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2025-03-17 14:24:54,545 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 375 flow. Second operand 8 states and 246 transitions. [2025-03-17 14:24:54,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 82 transitions, 521 flow [2025-03-17 14:24:54,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 82 transitions, 504 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:24:54,547 INFO L231 Difference]: Finished difference. Result has 86 places, 78 transitions, 386 flow [2025-03-17 14:24:54,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=386, PETRI_PLACES=86, PETRI_TRANSITIONS=78} [2025-03-17 14:24:54,548 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 23 predicate places. [2025-03-17 14:24:54,548 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 78 transitions, 386 flow [2025-03-17 14:24:54,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 27.5) internal successors, (495), 18 states have internal predecessors, (495), 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-17 14:24:54,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:24:54,548 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-03-17 14:24:54,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 14:24:54,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:54,750 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-17 14:24:54,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:24:54,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1776577645, now seen corresponding path program 2 times [2025-03-17 14:24:54,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:24:54,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286993815] [2025-03-17 14:24:54,751 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:24:54,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:24:54,757 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-17 14:24:54,771 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:24:54,771 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:24:54,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:54,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:24:54,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:24:54,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286993815] [2025-03-17 14:24:54,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286993815] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:24:54,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155307989] [2025-03-17 14:24:54,933 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:24:54,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:24:54,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:24:54,935 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-17 14:24:54,936 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-17 14:24:54,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-17 14:24:55,027 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:24:55,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:24:55,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:24:55,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 14:24:55,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:24:55,308 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-17 14:24:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:24:56,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:24:56,746 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:24:56,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155307989] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:24:56,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:24:56,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2025-03-17 14:24:56,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951899831] [2025-03-17 14:24:56,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:24:56,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:24:56,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:24:56,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:24:56,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:25:02,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:25:03,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 66 [2025-03-17 14:25:03,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 78 transitions, 386 flow. Second operand has 16 states, 16 states have (on average 32.625) internal successors, (522), 16 states have internal predecessors, (522), 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-17 14:25:03,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:03,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 66 [2025-03-17 14:25:03,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:11,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:25:15,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:25:19,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:25:39,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-17 14:25:39,976 INFO L124 PetriNetUnfolderBase]: 247/724 cut-off events. [2025-03-17 14:25:39,976 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2025-03-17 14:25:39,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1541 conditions, 724 events. 247/724 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4382 event pairs, 144 based on Foata normal form. 3/563 useless extension candidates. Maximal degree in co-relation 821. Up to 441 conditions per place. [2025-03-17 14:25:39,979 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 35 selfloop transitions, 28 changer transitions 0/84 dead transitions. [2025-03-17 14:25:39,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 84 transitions, 557 flow [2025-03-17 14:25:39,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:25:39,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:25:39,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 392 transitions. [2025-03-17 14:25:39,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5399449035812672 [2025-03-17 14:25:39,981 INFO L175 Difference]: Start difference. First operand has 86 places, 78 transitions, 386 flow. Second operand 11 states and 392 transitions. [2025-03-17 14:25:39,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 84 transitions, 557 flow [2025-03-17 14:25:39,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 84 transitions, 489 flow, removed 3 selfloop flow, removed 9 redundant places. [2025-03-17 14:25:39,984 INFO L231 Difference]: Finished difference. Result has 86 places, 84 transitions, 419 flow [2025-03-17 14:25:39,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=419, PETRI_PLACES=86, PETRI_TRANSITIONS=84} [2025-03-17 14:25:39,985 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 23 predicate places. [2025-03-17 14:25:39,985 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 84 transitions, 419 flow [2025-03-17 14:25:39,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 32.625) internal successors, (522), 16 states have internal predecessors, (522), 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-17 14:25:39,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:39,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:39,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 14:25:40,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:40,190 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-17 14:25:40,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:40,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1640182101, now seen corresponding path program 1 times [2025-03-17 14:25:40,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:40,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288490833] [2025-03-17 14:25:40,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:40,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:40,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:25:40,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:25:40,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:40,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:40,240 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-17 14:25:40,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:40,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288490833] [2025-03-17 14:25:40,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288490833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:40,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:40,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:25:40,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505158373] [2025-03-17 14:25:40,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:40,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:25:40,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:40,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:25:40,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:25:40,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2025-03-17 14:25:40,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 84 transitions, 419 flow. Second operand has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 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-17 14:25:40,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:40,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2025-03-17 14:25:40,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:40,413 INFO L124 PetriNetUnfolderBase]: 198/618 cut-off events. [2025-03-17 14:25:40,414 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2025-03-17 14:25:40,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1362 conditions, 618 events. 198/618 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3702 event pairs, 102 based on Foata normal form. 3/490 useless extension candidates. Maximal degree in co-relation 653. Up to 216 conditions per place. [2025-03-17 14:25:40,416 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 66 selfloop transitions, 11 changer transitions 9/108 dead transitions. [2025-03-17 14:25:40,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 108 transitions, 688 flow [2025-03-17 14:25:40,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:25:40,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:25:40,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2025-03-17 14:25:40,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2025-03-17 14:25:40,417 INFO L175 Difference]: Start difference. First operand has 86 places, 84 transitions, 419 flow. Second operand 5 states and 228 transitions. [2025-03-17 14:25:40,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 108 transitions, 688 flow [2025-03-17 14:25:40,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 108 transitions, 613 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-03-17 14:25:40,421 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 395 flow [2025-03-17 14:25:40,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=395, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2025-03-17 14:25:40,422 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 25 predicate places. [2025-03-17 14:25:40,422 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 395 flow [2025-03-17 14:25:40,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 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-17 14:25:40,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:40,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:40,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:25:40,423 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-17 14:25:40,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:40,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1403824818, now seen corresponding path program 1 times [2025-03-17 14:25:40,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:40,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905619016] [2025-03-17 14:25:40,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:40,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:40,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:25:40,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:25:40,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:40,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:25:40,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:40,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905619016] [2025-03-17 14:25:40,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905619016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:40,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:40,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:25:40,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880119661] [2025-03-17 14:25:40,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:40,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:25:40,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:40,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:25:40,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:25:40,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 66 [2025-03-17 14:25:40,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 395 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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-17 14:25:40,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:40,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 66 [2025-03-17 14:25:40,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:40,676 INFO L124 PetriNetUnfolderBase]: 253/695 cut-off events. [2025-03-17 14:25:40,677 INFO L125 PetriNetUnfolderBase]: For 296/302 co-relation queries the response was YES. [2025-03-17 14:25:40,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1660 conditions, 695 events. 253/695 cut-off events. For 296/302 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3925 event pairs, 175 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 803. Up to 459 conditions per place. [2025-03-17 14:25:40,680 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 51 selfloop transitions, 15 changer transitions 0/84 dead transitions. [2025-03-17 14:25:40,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 84 transitions, 523 flow [2025-03-17 14:25:40,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:25:40,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:25:40,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2025-03-17 14:25:40,681 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5242424242424243 [2025-03-17 14:25:40,681 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 395 flow. Second operand 5 states and 173 transitions. [2025-03-17 14:25:40,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 84 transitions, 523 flow [2025-03-17 14:25:40,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 84 transitions, 506 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:25:40,685 INFO L231 Difference]: Finished difference. Result has 88 places, 84 transitions, 404 flow [2025-03-17 14:25:40,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=404, PETRI_PLACES=88, PETRI_TRANSITIONS=84} [2025-03-17 14:25:40,685 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 25 predicate places. [2025-03-17 14:25:40,686 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 84 transitions, 404 flow [2025-03-17 14:25:40,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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-17 14:25:40,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:40,686 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:40,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:25:40,686 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-17 14:25:40,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:40,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1403824817, now seen corresponding path program 1 times [2025-03-17 14:25:40,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:40,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155854536] [2025-03-17 14:25:40,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:40,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:40,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:25:40,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:25:40,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:40,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:40,883 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:25:40,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:40,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155854536] [2025-03-17 14:25:40,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155854536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:40,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353885536] [2025-03-17 14:25:40,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:40,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:40,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:40,907 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-17 14:25:40,909 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-17 14:25:40,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:25:40,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:25:40,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:40,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:41,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:25:41,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:25:41,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:25:41,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353885536] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:41,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:41,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-03-17 14:25:41,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424465653] [2025-03-17 14:25:41,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:41,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:25:41,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:41,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:25:41,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:25:41,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 66 [2025-03-17 14:25:41,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 84 transitions, 404 flow. Second operand has 12 states, 12 states have (on average 33.5) internal successors, (402), 12 states have internal predecessors, (402), 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-17 14:25:41,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:41,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 66 [2025-03-17 14:25:41,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:43,493 INFO L124 PetriNetUnfolderBase]: 203/586 cut-off events. [2025-03-17 14:25:43,493 INFO L125 PetriNetUnfolderBase]: For 242/247 co-relation queries the response was YES. [2025-03-17 14:25:43,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1417 conditions, 586 events. 203/586 cut-off events. For 242/247 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3184 event pairs, 124 based on Foata normal form. 3/481 useless extension candidates. Maximal degree in co-relation 935. Up to 205 conditions per place. [2025-03-17 14:25:43,496 INFO L140 encePairwiseOnDemand]: 54/66 looper letters, 56 selfloop transitions, 38 changer transitions 3/116 dead transitions. [2025-03-17 14:25:43,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 116 transitions, 740 flow [2025-03-17 14:25:43,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 14:25:43,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-17 14:25:43,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 601 transitions. [2025-03-17 14:25:43,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.535650623885918 [2025-03-17 14:25:43,498 INFO L175 Difference]: Start difference. First operand has 88 places, 84 transitions, 404 flow. Second operand 17 states and 601 transitions. [2025-03-17 14:25:43,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 116 transitions, 740 flow [2025-03-17 14:25:43,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 116 transitions, 696 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:25:43,501 INFO L231 Difference]: Finished difference. Result has 101 places, 93 transitions, 501 flow [2025-03-17 14:25:43,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=501, PETRI_PLACES=101, PETRI_TRANSITIONS=93} [2025-03-17 14:25:43,503 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 38 predicate places. [2025-03-17 14:25:43,503 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 93 transitions, 501 flow [2025-03-17 14:25:43,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 33.5) internal successors, (402), 12 states have internal predecessors, (402), 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-17 14:25:43,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:43,504 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:43,510 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-17 14:25:43,704 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-17 14:25:43,704 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-17 14:25:43,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:43,705 INFO L85 PathProgramCache]: Analyzing trace with hash -90830281, now seen corresponding path program 1 times [2025-03-17 14:25:43,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:43,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326723444] [2025-03-17 14:25:43,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:43,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:43,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:25:43,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:25:43,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:43,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:43,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:43,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:43,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326723444] [2025-03-17 14:25:43,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326723444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:43,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454383133] [2025-03-17 14:25:43,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:43,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:43,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:43,780 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-17 14:25:43,782 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-17 14:25:43,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:25:43,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:25:43,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:43,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:43,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:25:43,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:43,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:25:43,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454383133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:43,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:25:43,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2025-03-17 14:25:43,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297746237] [2025-03-17 14:25:43,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:43,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:25:43,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:43,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:25:43,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:25:43,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-17 14:25:43,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 93 transitions, 501 flow. Second operand has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 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-17 14:25:43,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:43,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-17 14:25:43,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:44,109 INFO L124 PetriNetUnfolderBase]: 318/837 cut-off events. [2025-03-17 14:25:44,110 INFO L125 PetriNetUnfolderBase]: For 349/349 co-relation queries the response was YES. [2025-03-17 14:25:44,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2104 conditions, 837 events. 318/837 cut-off events. For 349/349 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4890 event pairs, 180 based on Foata normal form. 3/681 useless extension candidates. Maximal degree in co-relation 1439. Up to 363 conditions per place. [2025-03-17 14:25:44,113 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 79 selfloop transitions, 16 changer transitions 17/131 dead transitions. [2025-03-17 14:25:44,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 131 transitions, 893 flow [2025-03-17 14:25:44,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:25:44,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:25:44,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 266 transitions. [2025-03-17 14:25:44,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6717171717171717 [2025-03-17 14:25:44,114 INFO L175 Difference]: Start difference. First operand has 101 places, 93 transitions, 501 flow. Second operand 6 states and 266 transitions. [2025-03-17 14:25:44,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 131 transitions, 893 flow [2025-03-17 14:25:44,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 131 transitions, 814 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-03-17 14:25:44,118 INFO L231 Difference]: Finished difference. Result has 98 places, 96 transitions, 498 flow [2025-03-17 14:25:44,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=498, PETRI_PLACES=98, PETRI_TRANSITIONS=96} [2025-03-17 14:25:44,118 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 35 predicate places. [2025-03-17 14:25:44,118 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 96 transitions, 498 flow [2025-03-17 14:25:44,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 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-17 14:25:44,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:44,119 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:44,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 14:25:44,319 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-17 14:25:44,319 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-17 14:25:44,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:44,320 INFO L85 PathProgramCache]: Analyzing trace with hash -924616555, now seen corresponding path program 1 times [2025-03-17 14:25:44,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:44,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860465039] [2025-03-17 14:25:44,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:44,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:44,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:25:44,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:25:44,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:44,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:25:44,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:44,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860465039] [2025-03-17 14:25:44,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860465039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:44,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269737063] [2025-03-17 14:25:44,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:44,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:44,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:44,505 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-17 14:25:44,507 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-17 14:25:44,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:25:44,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:25:44,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:44,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:44,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 14:25:44,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:44,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:25:44,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:25:44,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 14:25:44,652 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 14:25:44,652 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-17 14:25:44,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:25:44,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 14:25:44,711 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-17 14:25:44,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-17 14:25:44,762 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:25:44,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:44,947 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 100 treesize of output 96 [2025-03-17 14:25:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:25:45,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269737063] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:45,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:45,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-03-17 14:25:45,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418115140] [2025-03-17 14:25:45,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:45,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:25:45,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:45,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:25:45,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:25:46,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 66 [2025-03-17 14:25:46,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 96 transitions, 498 flow. Second operand has 16 states, 16 states have (on average 29.0) internal successors, (464), 16 states have internal predecessors, (464), 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-17 14:25:46,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:46,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 66 [2025-03-17 14:25:46,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:47,121 INFO L124 PetriNetUnfolderBase]: 431/1035 cut-off events. [2025-03-17 14:25:47,121 INFO L125 PetriNetUnfolderBase]: For 379/404 co-relation queries the response was YES. [2025-03-17 14:25:47,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2458 conditions, 1035 events. 431/1035 cut-off events. For 379/404 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6182 event pairs, 196 based on Foata normal form. 0/916 useless extension candidates. Maximal degree in co-relation 2046. Up to 284 conditions per place. [2025-03-17 14:25:47,125 INFO L140 encePairwiseOnDemand]: 53/66 looper letters, 87 selfloop transitions, 42 changer transitions 7/153 dead transitions. [2025-03-17 14:25:47,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 153 transitions, 999 flow [2025-03-17 14:25:47,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:25:47,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:25:47,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 331 transitions. [2025-03-17 14:25:47,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5572390572390572 [2025-03-17 14:25:47,127 INFO L175 Difference]: Start difference. First operand has 98 places, 96 transitions, 498 flow. Second operand 9 states and 331 transitions. [2025-03-17 14:25:47,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 153 transitions, 999 flow [2025-03-17 14:25:47,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 153 transitions, 999 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:25:47,131 INFO L231 Difference]: Finished difference. Result has 108 places, 104 transitions, 652 flow [2025-03-17 14:25:47,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=652, PETRI_PLACES=108, PETRI_TRANSITIONS=104} [2025-03-17 14:25:47,133 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 45 predicate places. [2025-03-17 14:25:47,133 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 104 transitions, 652 flow [2025-03-17 14:25:47,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 29.0) internal successors, (464), 16 states have internal predecessors, (464), 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-17 14:25:47,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:47,134 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:47,141 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-17 14:25:47,339 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-17 14:25:47,339 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-17 14:25:47,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:47,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1401658421, now seen corresponding path program 1 times [2025-03-17 14:25:47,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:47,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516456173] [2025-03-17 14:25:47,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:47,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:47,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:25:47,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:25:47,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:47,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:25:47,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:47,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516456173] [2025-03-17 14:25:47,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516456173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:47,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49878049] [2025-03-17 14:25:47,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:47,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:47,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:47,479 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-17 14:25:47,480 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-17 14:25:47,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:25:47,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:25:47,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:47,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:47,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 14:25:47,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:47,556 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-17 14:25:47,570 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 14:25:47,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-17 14:25:47,594 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 14:25:47,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 14:25:47,617 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2025-03-17 14:25:47,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2025-03-17 14:25:47,663 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:25:47,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:25:47,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49878049] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:47,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:47,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2025-03-17 14:25:47,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703140841] [2025-03-17 14:25:47,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:47,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:25:47,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:47,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:25:47,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:25:47,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-03-17 14:25:47,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 104 transitions, 652 flow. Second operand has 10 states, 10 states have (on average 25.2) internal successors, (252), 10 states have internal predecessors, (252), 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-17 14:25:47,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:47,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-03-17 14:25:47,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:48,063 INFO L124 PetriNetUnfolderBase]: 394/926 cut-off events. [2025-03-17 14:25:48,063 INFO L125 PetriNetUnfolderBase]: For 686/709 co-relation queries the response was YES. [2025-03-17 14:25:48,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2532 conditions, 926 events. 394/926 cut-off events. For 686/709 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5161 event pairs, 258 based on Foata normal form. 48/941 useless extension candidates. Maximal degree in co-relation 2073. Up to 665 conditions per place. [2025-03-17 14:25:48,068 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 60 selfloop transitions, 29 changer transitions 0/102 dead transitions. [2025-03-17 14:25:48,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 102 transitions, 826 flow [2025-03-17 14:25:48,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:25:48,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:25:48,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2025-03-17 14:25:48,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44242424242424244 [2025-03-17 14:25:48,069 INFO L175 Difference]: Start difference. First operand has 108 places, 104 transitions, 652 flow. Second operand 5 states and 146 transitions. [2025-03-17 14:25:48,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 102 transitions, 826 flow [2025-03-17 14:25:48,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 102 transitions, 819 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 14:25:48,094 INFO L231 Difference]: Finished difference. Result has 109 places, 102 transitions, 699 flow [2025-03-17 14:25:48,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=699, PETRI_PLACES=109, PETRI_TRANSITIONS=102} [2025-03-17 14:25:48,094 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 46 predicate places. [2025-03-17 14:25:48,095 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 102 transitions, 699 flow [2025-03-17 14:25:48,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.2) internal successors, (252), 10 states have internal predecessors, (252), 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-17 14:25:48,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:48,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:48,102 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-17 14:25:48,295 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-17 14:25:48,296 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-17 14:25:48,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:48,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1401658422, now seen corresponding path program 1 times [2025-03-17 14:25:48,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:48,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74685791] [2025-03-17 14:25:48,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:48,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:48,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:25:48,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:25:48,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:48,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:48,624 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:25:48,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:48,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74685791] [2025-03-17 14:25:48,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74685791] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:48,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705817203] [2025-03-17 14:25:48,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:48,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:48,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:48,626 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-17 14:25:48,628 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-17 14:25:48,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:25:48,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:25:48,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:48,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:48,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-17 14:25:48,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:48,710 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-17 14:25:48,715 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-17 14:25:48,788 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 14:25:48,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 28 [2025-03-17 14:25:48,824 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 14:25:48,824 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 19 treesize of output 16 [2025-03-17 14:25:48,970 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2025-03-17 14:25:48,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 40 [2025-03-17 14:25:49,197 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 14:25:49,197 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 19 treesize of output 16 [2025-03-17 14:25:49,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:25:49,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-17 14:25:49,281 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:25:49,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:25:49,442 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:25:49,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:25:50,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705817203] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:50,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:50,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-03-17 14:25:50,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868147485] [2025-03-17 14:25:50,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:50,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 14:25:50,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:50,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 14:25:50,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2025-03-17 14:25:55,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:25:57,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:26:00,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:26:00,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 102 transitions, 699 flow. Second operand has 23 states, 23 states have (on average 19.82608695652174) internal successors, (456), 23 states have internal predecessors, (456), 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-17 14:26:00,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:00,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:26:00,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:05,414 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] [2025-03-17 14:26:10,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 14:26:14,043 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] [2025-03-17 14:26:18,180 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] [2025-03-17 14:26:19,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]