./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/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-?-798a7b3-m [2025-03-04 10:08:24,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:08:24,387 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:08:24,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:08:24,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:08:24,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:08:24,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:08:24,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:08:24,413 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:08:24,413 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:08:24,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:08:24,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:08:24,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:08:24,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:08:24,415 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:08:24,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:08:24,415 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:08:24,415 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:08:24,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:08:24,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:08:24,415 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:08:24,416 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:08:24,416 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:08:24,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:08:24,416 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:08:24,416 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:08:24,416 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:08:24,416 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:08:24,416 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:08:24,416 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:08:24,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:08:24,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:08:24,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:08:24,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:08:24,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:08:24,417 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:08:24,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:08:24,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:08:24,417 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:08:24,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:08:24,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:08:24,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:08:24,418 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-04 10:08:24,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:08:24,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:08:24,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:08:24,658 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:08:24,658 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:08:24,659 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-04 10:08:25,820 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16b7d9078/194e2a3a82054e2c9ba6a01e00517431/FLAG391ec9444 [2025-03-04 10:08:26,036 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:08:26,045 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2025-03-04 10:08:26,054 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16b7d9078/194e2a3a82054e2c9ba6a01e00517431/FLAG391ec9444 [2025-03-04 10:08:26,085 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16b7d9078/194e2a3a82054e2c9ba6a01e00517431 [2025-03-04 10:08:26,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:08:26,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:08:26,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:08:26,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:08:26,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:08:26,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:08:26" (1/1) ... [2025-03-04 10:08:26,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42e0a1a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:26, skipping insertion in model container [2025-03-04 10:08:26,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:08:26" (1/1) ... [2025-03-04 10:08:26,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:08:26,231 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:08:26,240 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:08:26,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:08:26,253 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:08:26,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:08:26,284 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:08:26,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:26 WrapperNode [2025-03-04 10:08:26,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:08:26,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:08:26,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:08:26,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:08:26,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:26" (1/1) ... [2025-03-04 10:08:26,295 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:26" (1/1) ... [2025-03-04 10:08:26,313 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 174 [2025-03-04 10:08:26,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:08:26,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:08:26,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:08:26,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:08:26,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:26" (1/1) ... [2025-03-04 10:08:26,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:26" (1/1) ... [2025-03-04 10:08:26,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:26" (1/1) ... [2025-03-04 10:08:26,332 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 3, 9]. 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, 1, 5]. [2025-03-04 10:08:26,332 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:26" (1/1) ... [2025-03-04 10:08:26,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:26" (1/1) ... [2025-03-04 10:08:26,339 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:26" (1/1) ... [2025-03-04 10:08:26,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:26" (1/1) ... [2025-03-04 10:08:26,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:26" (1/1) ... [2025-03-04 10:08:26,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:26" (1/1) ... [2025-03-04 10:08:26,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:08:26,349 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:08:26,349 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:08:26,349 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:08:26,350 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:26" (1/1) ... [2025-03-04 10:08:26,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:08:26,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:26,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:08:26,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:08:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 10:08:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 10:08:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 10:08:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:08:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:08:26,398 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:08:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:08:26,398 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:08:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:08:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:08:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:08:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 10:08:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 10:08:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 10:08:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:08:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:08:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:08:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:08:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:08:26,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:08:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:08:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:08:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:08:26,400 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:08:26,482 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:08:26,483 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:08:26,883 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:08:26,883 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:08:27,110 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:08:27,111 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:08:27,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:08:27 BoogieIcfgContainer [2025-03-04 10:08:27,111 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:08:27,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:08:27,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:08:27,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:08:27,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:08:26" (1/3) ... [2025-03-04 10:08:27,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fcf8af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:08:27, skipping insertion in model container [2025-03-04 10:08:27,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:26" (2/3) ... [2025-03-04 10:08:27,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fcf8af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:08:27, skipping insertion in model container [2025-03-04 10:08:27,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:08:27" (3/3) ... [2025-03-04 10:08:27,120 INFO L128 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2025-03-04 10:08:27,134 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:08:27,135 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-04 10:08:27,137 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:08:27,213 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:08:27,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 66 transitions, 146 flow [2025-03-04 10:08:27,278 INFO L124 PetriNetUnfolderBase]: 7/64 cut-off events. [2025-03-04 10:08:27,284 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:08:27,286 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-04 10:08:27,287 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 66 transitions, 146 flow [2025-03-04 10:08:27,289 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 63 transitions, 138 flow [2025-03-04 10:08:27,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:08:27,308 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;@59e52856, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:08:27,309 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-04 10:08:27,314 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:08:27,314 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:08:27,314 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:08:27,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:27,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:08:27,315 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:08:27,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:27,319 INFO L85 PathProgramCache]: Analyzing trace with hash 620471, now seen corresponding path program 1 times [2025-03-04 10:08:27,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:27,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124105407] [2025-03-04 10:08:27,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:27,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:27,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:08:27,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:08:27,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:27,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:27,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:27,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124105407] [2025-03-04 10:08:27,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124105407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:27,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:27,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:08:27,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645625846] [2025-03-04 10:08:27,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:27,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:08:27,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:27,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:08:27,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:08:27,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-04 10:08:27,564 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-04 10:08:27,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:27,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-04 10:08:27,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:27,653 INFO L124 PetriNetUnfolderBase]: 58/178 cut-off events. [2025-03-04 10:08:27,653 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-04 10:08:27,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 178 events. 58/178 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 691 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-04 10:08:27,656 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 25 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-03-04 10:08:27,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 186 flow [2025-03-04 10:08:27,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:08:27,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:08:27,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2025-03-04 10:08:27,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-03-04 10:08:27,667 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 138 flow. Second operand 3 states and 129 transitions. [2025-03-04 10:08:27,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 186 flow [2025-03-04 10:08:27,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 58 transitions, 178 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:08:27,675 INFO L231 Difference]: Finished difference. Result has 56 places, 58 transitions, 128 flow [2025-03-04 10:08:27,677 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-04 10:08:27,679 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -7 predicate places. [2025-03-04 10:08:27,680 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 128 flow [2025-03-04 10:08:27,680 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-04 10:08:27,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:27,680 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:08:27,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:08:27,680 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:08:27,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:27,681 INFO L85 PathProgramCache]: Analyzing trace with hash 620472, now seen corresponding path program 1 times [2025-03-04 10:08:27,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:27,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280709694] [2025-03-04 10:08:27,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:27,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:27,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:08:27,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:08:27,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:27,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:08:27,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1823646507] [2025-03-04 10:08:27,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:27,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:27,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:27,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:08:27,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:08:27,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:08:27,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:08:27,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:27,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:27,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:08:27,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:27,895 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-04 10:08:28,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:28,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:08:28,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:28,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280709694] [2025-03-04 10:08:28,301 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:08:28,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823646507] [2025-03-04 10:08:28,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823646507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:28,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:28,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:08:28,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062181559] [2025-03-04 10:08:28,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:28,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:08:28,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:28,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:08:28,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:08:32,311 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-04 10:08:36,377 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-04 10:08:40,444 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-04 10:08:44,530 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-04 10:08:45,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 66 [2025-03-04 10:08:45,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 58 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:45,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:45,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 66 [2025-03-04 10:08:45,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:46,108 INFO L124 PetriNetUnfolderBase]: 58/177 cut-off events. [2025-03-04 10:08:46,108 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:08:46,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 177 events. 58/177 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 688 event pairs, 30 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 257. Up to 105 conditions per place. [2025-03-04 10:08:46,109 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 28 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2025-03-04 10:08:46,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 190 flow [2025-03-04 10:08:46,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:08:46,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:08:46,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2025-03-04 10:08:46,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5643939393939394 [2025-03-04 10:08:46,112 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 128 flow. Second operand 4 states and 149 transitions. [2025-03-04 10:08:46,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 190 flow [2025-03-04 10:08:46,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 57 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:08:46,113 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 126 flow [2025-03-04 10:08:46,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2025-03-04 10:08:46,113 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -7 predicate places. [2025-03-04 10:08:46,113 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 126 flow [2025-03-04 10:08:46,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:46,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:46,113 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:08:46,120 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-04 10:08:46,314 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-04 10:08:46,314 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:08:46,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:46,315 INFO L85 PathProgramCache]: Analyzing trace with hash 19236874, now seen corresponding path program 1 times [2025-03-04 10:08:46,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:46,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71091225] [2025-03-04 10:08:46,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:46,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:46,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:08:46,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:08:46,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:46,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:46,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:46,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:46,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71091225] [2025-03-04 10:08:46,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71091225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:46,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:46,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:08:46,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716097601] [2025-03-04 10:08:46,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:46,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:08:46,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:46,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:08:46,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:08:46,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2025-03-04 10:08:46,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 126 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-04 10:08:46,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:46,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2025-03-04 10:08:46,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:46,657 INFO L124 PetriNetUnfolderBase]: 60/185 cut-off events. [2025-03-04 10:08:46,657 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:08:46,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 185 events. 60/185 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 727 event pairs, 30 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 272. Up to 107 conditions per place. [2025-03-04 10:08:46,658 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 29 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2025-03-04 10:08:46,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 64 transitions, 218 flow [2025-03-04 10:08:46,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:08:46,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:08:46,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2025-03-04 10:08:46,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6704545454545454 [2025-03-04 10:08:46,661 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 126 flow. Second operand 4 states and 177 transitions. [2025-03-04 10:08:46,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 64 transitions, 218 flow [2025-03-04 10:08:46,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 204 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:08:46,663 INFO L231 Difference]: Finished difference. Result has 58 places, 62 transitions, 158 flow [2025-03-04 10:08:46,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=58, PETRI_TRANSITIONS=62} [2025-03-04 10:08:46,664 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -5 predicate places. [2025-03-04 10:08:46,664 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 62 transitions, 158 flow [2025-03-04 10:08:46,665 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-04 10:08:46,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:46,665 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:08:46,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:08:46,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:08:46,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:46,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1305199876, now seen corresponding path program 1 times [2025-03-04 10:08:46,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:46,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935448622] [2025-03-04 10:08:46,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:46,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:46,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:08:46,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:08:46,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:46,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:46,992 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-04 10:08:46,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:46,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935448622] [2025-03-04 10:08:46,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935448622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:46,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17192015] [2025-03-04 10:08:46,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:46,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:46,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:46,995 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:08:46,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:08:47,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:08:47,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:08:47,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:47,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:47,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:08:47,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:47,069 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-04 10:08:47,226 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:08:47,226 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-04 10:08:47,265 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-04 10:08:47,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:47,392 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-04 10:08:47,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17192015] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:47,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:08:47,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 10 [2025-03-04 10:08:47,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639389480] [2025-03-04 10:08:47,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:47,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:08:47,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:47,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:08:47,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:08:47,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-04 10:08:47,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 62 transitions, 158 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-04 10:08:47,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:47,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-04 10:08:47,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:47,879 INFO L124 PetriNetUnfolderBase]: 115/353 cut-off events. [2025-03-04 10:08:47,879 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 10:08:47,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 353 events. 115/353 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1796 event pairs, 60 based on Foata normal form. 1/251 useless extension candidates. Maximal degree in co-relation 292. Up to 107 conditions per place. [2025-03-04 10:08:47,882 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 55 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2025-03-04 10:08:47,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 87 transitions, 336 flow [2025-03-04 10:08:47,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:08:47,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:08:47,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 222 transitions. [2025-03-04 10:08:47,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6727272727272727 [2025-03-04 10:08:47,885 INFO L175 Difference]: Start difference. First operand has 58 places, 62 transitions, 158 flow. Second operand 5 states and 222 transitions. [2025-03-04 10:08:47,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 87 transitions, 336 flow [2025-03-04 10:08:47,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 87 transitions, 336 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:08:47,886 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 175 flow [2025-03-04 10:08:47,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2025-03-04 10:08:47,887 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 0 predicate places. [2025-03-04 10:08:47,887 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 175 flow [2025-03-04 10:08:47,887 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-04 10:08:47,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:47,888 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:08:47,893 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-04 10:08:48,091 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-04 10:08:48,091 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:08:48,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:48,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1306802994, now seen corresponding path program 1 times [2025-03-04 10:08:48,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:48,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662790227] [2025-03-04 10:08:48,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:48,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:48,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:08:48,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:08:48,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:48,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:48,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:48,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:48,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662790227] [2025-03-04 10:08:48,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662790227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:48,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:48,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:08:48,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340651584] [2025-03-04 10:08:48,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:48,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:08:48,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:48,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:08:48,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:08:48,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-04 10:08:48,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 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-04 10:08:48,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:48,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-04 10:08:48,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:48,735 INFO L124 PetriNetUnfolderBase]: 139/391 cut-off events. [2025-03-04 10:08:48,735 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 10:08:48,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 391 events. 139/391 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1963 event pairs, 76 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 340. Up to 247 conditions per place. [2025-03-04 10:08:48,737 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 36 selfloop transitions, 7 changer transitions 0/68 dead transitions. [2025-03-04 10:08:48,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 273 flow [2025-03-04 10:08:48,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:08:48,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:08:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 199 transitions. [2025-03-04 10:08:48,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.603030303030303 [2025-03-04 10:08:48,740 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 175 flow. Second operand 5 states and 199 transitions. [2025-03-04 10:08:48,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 273 flow [2025-03-04 10:08:48,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 68 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:08:48,742 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 208 flow [2025-03-04 10:08:48,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2025-03-04 10:08:48,743 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 5 predicate places. [2025-03-04 10:08:48,743 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 208 flow [2025-03-04 10:08:48,743 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-04 10:08:48,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:48,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:08:48,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:08:48,744 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:08:48,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:48,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1306802993, now seen corresponding path program 1 times [2025-03-04 10:08:48,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:48,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352164108] [2025-03-04 10:08:48,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:48,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:48,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:08:48,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:08:48,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:48,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:48,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:48,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:48,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352164108] [2025-03-04 10:08:48,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352164108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:48,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:48,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:08:48,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888075454] [2025-03-04 10:08:48,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:48,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:08:48,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:48,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:08:48,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:08:48,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2025-03-04 10:08:48,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 208 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-04 10:08:48,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:48,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2025-03-04 10:08:48,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:48,956 INFO L124 PetriNetUnfolderBase]: 139/373 cut-off events. [2025-03-04 10:08:48,956 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 10:08:48,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 695 conditions, 373 events. 139/373 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1767 event pairs, 76 based on Foata normal form. 4/303 useless extension candidates. Maximal degree in co-relation 620. Up to 245 conditions per place. [2025-03-04 10:08:48,960 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 36 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2025-03-04 10:08:48,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 62 transitions, 280 flow [2025-03-04 10:08:48,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:08:48,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:08:48,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2025-03-04 10:08:48,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6262626262626263 [2025-03-04 10:08:48,961 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 208 flow. Second operand 3 states and 124 transitions. [2025-03-04 10:08:48,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 62 transitions, 280 flow [2025-03-04 10:08:48,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 62 transitions, 273 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:08:48,963 INFO L231 Difference]: Finished difference. Result has 65 places, 62 transitions, 201 flow [2025-03-04 10:08:48,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=65, PETRI_TRANSITIONS=62} [2025-03-04 10:08:48,963 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2025-03-04 10:08:48,963 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 201 flow [2025-03-04 10:08:48,964 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-04 10:08:48,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:48,964 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:08:48,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:08:48,964 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:08:48,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:48,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1306803020, now seen corresponding path program 1 times [2025-03-04 10:08:48,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:48,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895793174] [2025-03-04 10:08:48,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:48,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:48,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:08:48,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:08:48,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:48,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:49,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:49,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895793174] [2025-03-04 10:08:49,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895793174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:49,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:49,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:08:49,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227912689] [2025-03-04 10:08:49,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:49,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:08:49,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:49,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:08:49,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:08:49,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-04 10:08:49,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 201 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-04 10:08:49,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:49,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-04 10:08:49,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:49,586 INFO L124 PetriNetUnfolderBase]: 123/363 cut-off events. [2025-03-04 10:08:49,586 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-04 10:08:49,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 363 events. 123/363 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1822 event pairs, 60 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 563. Up to 227 conditions per place. [2025-03-04 10:08:49,588 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 34 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2025-03-04 10:08:49,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 295 flow [2025-03-04 10:08:49,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:08:49,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:08:49,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 198 transitions. [2025-03-04 10:08:49,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 10:08:49,590 INFO L175 Difference]: Start difference. First operand has 65 places, 62 transitions, 201 flow. Second operand 5 states and 198 transitions. [2025-03-04 10:08:49,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 295 flow [2025-03-04 10:08:49,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 66 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:08:49,593 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 245 flow [2025-03-04 10:08:49,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=245, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2025-03-04 10:08:49,594 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 7 predicate places. [2025-03-04 10:08:49,595 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 245 flow [2025-03-04 10:08:49,595 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-04 10:08:49,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:49,595 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:49,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:08:49,596 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:08:49,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:49,596 INFO L85 PathProgramCache]: Analyzing trace with hash 166650161, now seen corresponding path program 1 times [2025-03-04 10:08:49,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:49,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457234170] [2025-03-04 10:08:49,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:49,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:49,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:08:49,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:08:49,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:49,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:49,706 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-04 10:08:49,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:49,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457234170] [2025-03-04 10:08:49,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457234170] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:49,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387173350] [2025-03-04 10:08:49,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:49,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:49,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:49,709 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:08:49,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:08:49,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:08:49,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:08:49,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:49,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:49,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:08:49,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:49,852 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-04 10:08:49,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:49,930 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-04 10:08:49,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387173350] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:49,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:49,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 10:08:49,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497783895] [2025-03-04 10:08:49,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:49,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:08:49,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:49,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:08:49,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:08:50,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2025-03-04 10:08:50,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 245 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-04 10:08:50,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:50,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2025-03-04 10:08:50,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:50,416 INFO L124 PetriNetUnfolderBase]: 233/682 cut-off events. [2025-03-04 10:08:50,416 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 10:08:50,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1262 conditions, 682 events. 233/682 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4060 event pairs, 120 based on Foata normal form. 1/517 useless extension candidates. Maximal degree in co-relation 620. Up to 216 conditions per place. [2025-03-04 10:08:50,419 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 47 selfloop transitions, 23 changer transitions 0/95 dead transitions. [2025-03-04 10:08:50,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 95 transitions, 499 flow [2025-03-04 10:08:50,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:08:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:08:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 380 transitions. [2025-03-04 10:08:50,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6397306397306397 [2025-03-04 10:08:50,421 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 245 flow. Second operand 9 states and 380 transitions. [2025-03-04 10:08:50,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 95 transitions, 499 flow [2025-03-04 10:08:50,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 95 transitions, 491 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:08:50,423 INFO L231 Difference]: Finished difference. Result has 79 places, 76 transitions, 380 flow [2025-03-04 10:08:50,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=380, PETRI_PLACES=79, PETRI_TRANSITIONS=76} [2025-03-04 10:08:50,423 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 16 predicate places. [2025-03-04 10:08:50,423 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 76 transitions, 380 flow [2025-03-04 10:08:50,423 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-04 10:08:50,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:50,424 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:50,430 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-04 10:08:50,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:50,624 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:08:50,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:50,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1708676453, now seen corresponding path program 1 times [2025-03-04 10:08:50,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:50,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267459783] [2025-03-04 10:08:50,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:50,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:50,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:08:50,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:08:50,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:50,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:50,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:50,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267459783] [2025-03-04 10:08:50,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267459783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:50,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:50,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:08:50,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427080969] [2025-03-04 10:08:50,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:50,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:08:50,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:50,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:08:50,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:08:50,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-04 10:08:50,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 76 transitions, 380 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-04 10:08:50,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:50,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-04 10:08:50,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:51,037 INFO L124 PetriNetUnfolderBase]: 337/973 cut-off events. [2025-03-04 10:08:51,037 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-04 10:08:51,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1867 conditions, 973 events. 337/973 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6321 event pairs, 156 based on Foata normal form. 0/735 useless extension candidates. Maximal degree in co-relation 1236. Up to 269 conditions per place. [2025-03-04 10:08:51,041 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 72 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2025-03-04 10:08:51,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 112 transitions, 687 flow [2025-03-04 10:08:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:08:51,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:08:51,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 274 transitions. [2025-03-04 10:08:51,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6919191919191919 [2025-03-04 10:08:51,044 INFO L175 Difference]: Start difference. First operand has 79 places, 76 transitions, 380 flow. Second operand 6 states and 274 transitions. [2025-03-04 10:08:51,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 112 transitions, 687 flow [2025-03-04 10:08:51,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 112 transitions, 642 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-04 10:08:51,047 INFO L231 Difference]: Finished difference. Result has 83 places, 82 transitions, 431 flow [2025-03-04 10:08:51,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=431, PETRI_PLACES=83, PETRI_TRANSITIONS=82} [2025-03-04 10:08:51,048 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 20 predicate places. [2025-03-04 10:08:51,048 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 82 transitions, 431 flow [2025-03-04 10:08:51,048 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-04 10:08:51,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:51,049 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:51,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:08:51,049 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:08:51,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:51,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1707270780, now seen corresponding path program 1 times [2025-03-04 10:08:51,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:51,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192849984] [2025-03-04 10:08:51,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:51,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:51,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:08:51,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:08:51,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:51,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:51,280 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-04 10:08:51,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:51,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192849984] [2025-03-04 10:08:51,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192849984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:51,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339363847] [2025-03-04 10:08:51,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:51,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:51,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:51,283 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:08:51,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:08:51,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:08:51,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:08:51,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:51,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:51,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:08:51,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:51,374 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-04 10:08:51,554 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-04 10:08:51,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:51,732 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-04 10:08:51,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339363847] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:51,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:51,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 10:08:51,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591790823] [2025-03-04 10:08:51,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:51,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:08:51,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:51,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:08:51,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:08:52,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-04 10:08:52,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 431 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-04 10:08:52,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:52,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-04 10:08:52,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:53,506 INFO L124 PetriNetUnfolderBase]: 311/1001 cut-off events. [2025-03-04 10:08:53,506 INFO L125 PetriNetUnfolderBase]: For 325/325 co-relation queries the response was YES. [2025-03-04 10:08:53,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2130 conditions, 1001 events. 311/1001 cut-off events. For 325/325 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7060 event pairs, 180 based on Foata normal form. 12/763 useless extension candidates. Maximal degree in co-relation 1342. Up to 556 conditions per place. [2025-03-04 10:08:53,511 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 35 selfloop transitions, 26 changer transitions 0/84 dead transitions. [2025-03-04 10:08:53,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 84 transitions, 567 flow [2025-03-04 10:08:53,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:08:53,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:08:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 332 transitions. [2025-03-04 10:08:53,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5589225589225589 [2025-03-04 10:08:53,513 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 431 flow. Second operand 9 states and 332 transitions. [2025-03-04 10:08:53,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 84 transitions, 567 flow [2025-03-04 10:08:53,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 84 transitions, 558 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:08:53,517 INFO L231 Difference]: Finished difference. Result has 89 places, 84 transitions, 488 flow [2025-03-04 10:08:53,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=488, PETRI_PLACES=89, PETRI_TRANSITIONS=84} [2025-03-04 10:08:53,517 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 26 predicate places. [2025-03-04 10:08:53,517 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 84 transitions, 488 flow [2025-03-04 10:08:53,518 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-04 10:08:53,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:53,518 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:08:53,524 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-04 10:08:53,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:53,719 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:08:53,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:53,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1385005422, now seen corresponding path program 1 times [2025-03-04 10:08:53,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:53,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844221790] [2025-03-04 10:08:53,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:53,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:53,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:08:53,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:08:53,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:53,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:54,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:54,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844221790] [2025-03-04 10:08:54,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844221790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:54,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273519602] [2025-03-04 10:08:54,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:54,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:54,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:54,136 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:08:54,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:08:54,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:08:54,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:08:54,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:54,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:54,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 10:08:54,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:54,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:08:54,267 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-04 10:08:54,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:08:54,339 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-04 10:08:54,355 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:08:54,355 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-04 10:08:54,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:08:54,499 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-04 10:08:54,550 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:08:54,551 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-04 10:08:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:54,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:54,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:08:54,764 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-04 10:08:54,965 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 10:08:55,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:55,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273519602] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:55,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:55,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-03-04 10:08:55,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934224374] [2025-03-04 10:08:55,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:55,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:08:55,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:55,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:08:55,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:08:56,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2025-03-04 10:08:56,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 84 transitions, 488 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-04 10:08:56,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:56,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2025-03-04 10:08:56,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:57,010 INFO L124 PetriNetUnfolderBase]: 375/1124 cut-off events. [2025-03-04 10:08:57,011 INFO L125 PetriNetUnfolderBase]: For 431/431 co-relation queries the response was YES. [2025-03-04 10:08:57,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2611 conditions, 1124 events. 375/1124 cut-off events. For 431/431 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7911 event pairs, 228 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 1643. Up to 634 conditions per place. [2025-03-04 10:08:57,016 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 64 selfloop transitions, 24 changer transitions 0/109 dead transitions. [2025-03-04 10:08:57,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 109 transitions, 892 flow [2025-03-04 10:08:57,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:08:57,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:08:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 305 transitions. [2025-03-04 10:08:57,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2025-03-04 10:08:57,017 INFO L175 Difference]: Start difference. First operand has 89 places, 84 transitions, 488 flow. Second operand 10 states and 305 transitions. [2025-03-04 10:08:57,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 109 transitions, 892 flow [2025-03-04 10:08:57,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 109 transitions, 769 flow, removed 20 selfloop flow, removed 6 redundant places. [2025-03-04 10:08:57,021 INFO L231 Difference]: Finished difference. Result has 92 places, 91 transitions, 528 flow [2025-03-04 10:08:57,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=528, PETRI_PLACES=92, PETRI_TRANSITIONS=91} [2025-03-04 10:08:57,022 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 29 predicate places. [2025-03-04 10:08:57,022 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 91 transitions, 528 flow [2025-03-04 10:08:57,022 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-04 10:08:57,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:57,022 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-03-04 10:08:57,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:08:57,227 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,SelfDestructingSolverStorable10 [2025-03-04 10:08:57,227 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:08:57,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:57,227 INFO L85 PathProgramCache]: Analyzing trace with hash -287698645, now seen corresponding path program 2 times [2025-03-04 10:08:57,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:57,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783115092] [2025-03-04 10:08:57,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:08:57,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:57,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-04 10:08:57,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:08:57,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:08:57,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:57,487 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:57,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:57,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783115092] [2025-03-04 10:08:57,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783115092] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:57,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727902628] [2025-03-04 10:08:57,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:08:57,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:57,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:57,489 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:08:57,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:08:57,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-04 10:08:57,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:08:57,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:08:57,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:57,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 10:08:57,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:57,571 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-04 10:08:57,763 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:08:57,764 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 23 treesize of output 20 [2025-03-04 10:08:57,910 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:57,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:58,211 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:58,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727902628] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:58,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:58,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-04 10:08:58,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578679955] [2025-03-04 10:08:58,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:58,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:08:58,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:58,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:08:58,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:08:59,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-04 10:08:59,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 91 transitions, 528 flow. Second operand has 20 states, 20 states have (on average 33.5) internal successors, (670), 20 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:59,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:59,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-04 10:08:59,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:00,941 INFO L124 PetriNetUnfolderBase]: 394/1263 cut-off events. [2025-03-04 10:09:00,942 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2025-03-04 10:09:00,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2870 conditions, 1263 events. 394/1263 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9387 event pairs, 210 based on Foata normal form. 7/965 useless extension candidates. Maximal degree in co-relation 1533. Up to 369 conditions per place. [2025-03-04 10:09:00,950 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 72 selfloop transitions, 71 changer transitions 0/165 dead transitions. [2025-03-04 10:09:00,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 165 transitions, 1275 flow [2025-03-04 10:09:00,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:09:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 10:09:00,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 888 transitions. [2025-03-04 10:09:00,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2025-03-04 10:09:00,952 INFO L175 Difference]: Start difference. First operand has 92 places, 91 transitions, 528 flow. Second operand 24 states and 888 transitions. [2025-03-04 10:09:00,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 165 transitions, 1275 flow [2025-03-04 10:09:00,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 165 transitions, 1136 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-03-04 10:09:00,958 INFO L231 Difference]: Finished difference. Result has 117 places, 139 transitions, 993 flow [2025-03-04 10:09:00,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=993, PETRI_PLACES=117, PETRI_TRANSITIONS=139} [2025-03-04 10:09:00,958 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 54 predicate places. [2025-03-04 10:09:00,958 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 139 transitions, 993 flow [2025-03-04 10:09:00,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 33.5) internal successors, (670), 20 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:00,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:00,959 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:00,965 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-04 10:09:01,163 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-04 10:09:01,163 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:09:01,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:01,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1150979345, now seen corresponding path program 1 times [2025-03-04 10:09:01,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:01,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989358084] [2025-03-04 10:09:01,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:01,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:01,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:09:01,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:09:01,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:01,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:01,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:01,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989358084] [2025-03-04 10:09:01,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989358084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:01,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:01,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:09:01,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048145594] [2025-03-04 10:09:01,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:01,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:09:01,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:01,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:09:01,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:09:01,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2025-03-04 10:09:01,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 139 transitions, 993 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-04 10:09:01,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:01,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2025-03-04 10:09:01,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:01,514 INFO L124 PetriNetUnfolderBase]: 331/1021 cut-off events. [2025-03-04 10:09:01,514 INFO L125 PetriNetUnfolderBase]: For 494/494 co-relation queries the response was YES. [2025-03-04 10:09:01,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2650 conditions, 1021 events. 331/1021 cut-off events. For 494/494 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6587 event pairs, 160 based on Foata normal form. 5/844 useless extension candidates. Maximal degree in co-relation 2371. Up to 382 conditions per place. [2025-03-04 10:09:01,519 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 110 selfloop transitions, 24 changer transitions 9/166 dead transitions. [2025-03-04 10:09:01,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 166 transitions, 1417 flow [2025-03-04 10:09:01,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:09:01,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:09:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2025-03-04 10:09:01,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2025-03-04 10:09:01,520 INFO L175 Difference]: Start difference. First operand has 117 places, 139 transitions, 993 flow. Second operand 5 states and 228 transitions. [2025-03-04 10:09:01,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 166 transitions, 1417 flow [2025-03-04 10:09:01,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 166 transitions, 1364 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:01,526 INFO L231 Difference]: Finished difference. Result has 121 places, 141 transitions, 1005 flow [2025-03-04 10:09:01,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1005, PETRI_PLACES=121, PETRI_TRANSITIONS=141} [2025-03-04 10:09:01,527 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 58 predicate places. [2025-03-04 10:09:01,527 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 141 transitions, 1005 flow [2025-03-04 10:09:01,528 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-04 10:09:01,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:01,528 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:01,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:09:01,528 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:09:01,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:01,528 INFO L85 PathProgramCache]: Analyzing trace with hash -898448628, now seen corresponding path program 1 times [2025-03-04 10:09:01,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:01,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017334542] [2025-03-04 10:09:01,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:01,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:01,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:09:01,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:09:01,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:01,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:09:01,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:01,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017334542] [2025-03-04 10:09:01,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017334542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:01,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:01,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:09:01,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022862739] [2025-03-04 10:09:01,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:01,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:09:01,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:01,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:09:01,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:09:01,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 66 [2025-03-04 10:09:01,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 141 transitions, 1005 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-04 10:09:01,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:01,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 66 [2025-03-04 10:09:01,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:01,798 INFO L124 PetriNetUnfolderBase]: 319/888 cut-off events. [2025-03-04 10:09:01,798 INFO L125 PetriNetUnfolderBase]: For 571/579 co-relation queries the response was YES. [2025-03-04 10:09:01,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2482 conditions, 888 events. 319/888 cut-off events. For 571/579 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5083 event pairs, 206 based on Foata normal form. 0/804 useless extension candidates. Maximal degree in co-relation 2132. Up to 562 conditions per place. [2025-03-04 10:09:01,802 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 83 selfloop transitions, 37 changer transitions 0/139 dead transitions. [2025-03-04 10:09:01,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 139 transitions, 1241 flow [2025-03-04 10:09:01,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:09:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:09:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2025-03-04 10:09:01,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5242424242424243 [2025-03-04 10:09:01,804 INFO L175 Difference]: Start difference. First operand has 121 places, 141 transitions, 1005 flow. Second operand 5 states and 173 transitions. [2025-03-04 10:09:01,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 139 transitions, 1241 flow [2025-03-04 10:09:01,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 139 transitions, 1194 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:01,812 INFO L231 Difference]: Finished difference. Result has 121 places, 139 transitions, 1028 flow [2025-03-04 10:09:01,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1028, PETRI_PLACES=121, PETRI_TRANSITIONS=139} [2025-03-04 10:09:01,813 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 58 predicate places. [2025-03-04 10:09:01,813 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 139 transitions, 1028 flow [2025-03-04 10:09:01,813 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-04 10:09:01,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:01,813 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:01,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:09:01,814 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:09:01,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:01,814 INFO L85 PathProgramCache]: Analyzing trace with hash -898448627, now seen corresponding path program 1 times [2025-03-04 10:09:01,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:01,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341907536] [2025-03-04 10:09:01,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:01,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:01,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:09:01,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:09:01,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:01,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:01,989 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-04 10:09:01,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:01,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341907536] [2025-03-04 10:09:01,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341907536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:01,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354634405] [2025-03-04 10:09:01,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:01,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:01,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:01,991 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:01,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:09:02,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:09:02,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:09:02,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:02,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:02,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:09:02,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:02,184 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:02,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:02,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:02,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354634405] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:02,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:02,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-03-04 10:09:02,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956073064] [2025-03-04 10:09:02,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:02,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:09:02,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:02,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:09:02,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:09:02,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 66 [2025-03-04 10:09:02,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 139 transitions, 1028 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-04 10:09:02,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:02,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 66 [2025-03-04 10:09:02,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:06,999 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-04 10:09:11,995 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-04 10:09:13,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 10:09:17,554 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-04 10:09:17,738 INFO L124 PetriNetUnfolderBase]: 236/687 cut-off events. [2025-03-04 10:09:17,738 INFO L125 PetriNetUnfolderBase]: For 477/477 co-relation queries the response was YES. [2025-03-04 10:09:17,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2121 conditions, 687 events. 236/687 cut-off events. For 477/477 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3967 event pairs, 124 based on Foata normal form. 4/585 useless extension candidates. Maximal degree in co-relation 2022. Up to 209 conditions per place. [2025-03-04 10:09:17,742 INFO L140 encePairwiseOnDemand]: 54/66 looper letters, 87 selfloop transitions, 71 changer transitions 3/181 dead transitions. [2025-03-04 10:09:17,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 181 transitions, 1637 flow [2025-03-04 10:09:17,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:09:17,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 10:09:17,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 601 transitions. [2025-03-04 10:09:17,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.535650623885918 [2025-03-04 10:09:17,744 INFO L175 Difference]: Start difference. First operand has 121 places, 139 transitions, 1028 flow. Second operand 17 states and 601 transitions. [2025-03-04 10:09:17,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 181 transitions, 1637 flow [2025-03-04 10:09:17,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 181 transitions, 1545 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:09:17,751 INFO L231 Difference]: Finished difference. Result has 134 places, 152 transitions, 1214 flow [2025-03-04 10:09:17,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1214, PETRI_PLACES=134, PETRI_TRANSITIONS=152} [2025-03-04 10:09:17,751 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 71 predicate places. [2025-03-04 10:09:17,751 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 152 transitions, 1214 flow [2025-03-04 10:09:17,752 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-04 10:09:17,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:17,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:17,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:17,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:17,957 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:09:17,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:17,957 INFO L85 PathProgramCache]: Analyzing trace with hash 301642291, now seen corresponding path program 1 times [2025-03-04 10:09:17,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:17,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708350996] [2025-03-04 10:09:17,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:17,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:17,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:09:17,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:09:17,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:17,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:18,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:18,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708350996] [2025-03-04 10:09:18,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708350996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:18,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804300402] [2025-03-04 10:09:18,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:18,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:18,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:18,045 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:18,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:09:18,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:09:18,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:09:18,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:18,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:18,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:09:18,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:18,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:09:18,178 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:09:18,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804300402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:18,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:09:18,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2025-03-04 10:09:18,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340271110] [2025-03-04 10:09:18,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:18,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:09:18,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:18,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:09:18,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:09:18,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-04 10:09:18,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 152 transitions, 1214 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-04 10:09:18,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:18,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-04 10:09:18,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:18,452 INFO L124 PetriNetUnfolderBase]: 366/985 cut-off events. [2025-03-04 10:09:18,453 INFO L125 PetriNetUnfolderBase]: For 630/630 co-relation queries the response was YES. [2025-03-04 10:09:18,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3093 conditions, 985 events. 366/985 cut-off events. For 630/630 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6071 event pairs, 180 based on Foata normal form. 3/829 useless extension candidates. Maximal degree in co-relation 2993. Up to 451 conditions per place. [2025-03-04 10:09:18,457 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 133 selfloop transitions, 24 changer transitions 26/203 dead transitions. [2025-03-04 10:09:18,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 203 transitions, 1901 flow [2025-03-04 10:09:18,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:09:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:09:18,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 266 transitions. [2025-03-04 10:09:18,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6717171717171717 [2025-03-04 10:09:18,458 INFO L175 Difference]: Start difference. First operand has 134 places, 152 transitions, 1214 flow. Second operand 6 states and 266 transitions. [2025-03-04 10:09:18,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 203 transitions, 1901 flow [2025-03-04 10:09:18,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 203 transitions, 1791 flow, removed 17 selfloop flow, removed 6 redundant places. [2025-03-04 10:09:18,466 INFO L231 Difference]: Finished difference. Result has 133 places, 154 transitions, 1198 flow [2025-03-04 10:09:18,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1198, PETRI_PLACES=133, PETRI_TRANSITIONS=154} [2025-03-04 10:09:18,467 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 70 predicate places. [2025-03-04 10:09:18,467 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 154 transitions, 1198 flow [2025-03-04 10:09:18,467 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-04 10:09:18,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:18,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:18,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:09:18,668 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-04 10:09:18,668 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:09:18,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:18,668 INFO L85 PathProgramCache]: Analyzing trace with hash 877091227, now seen corresponding path program 1 times [2025-03-04 10:09:18,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:18,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517520122] [2025-03-04 10:09:18,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:18,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:18,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:09:18,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:18,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:18,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:18,957 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-04 10:09:18,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:18,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517520122] [2025-03-04 10:09:18,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517520122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:18,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133657729] [2025-03-04 10:09:18,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:18,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:18,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:18,960 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:18,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:09:19,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:09:19,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:19,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:19,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:19,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 10:09:19,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:19,045 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-04 10:09:19,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:09:19,125 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-04 10:09:19,147 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 10:09:19,147 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-04 10:09:19,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:09:19,177 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-04 10:09:19,193 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:09:19,193 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-04 10:09:19,273 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-04 10:09:19,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:19,495 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 162 treesize of output 156 [2025-03-04 10:09:19,672 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-04 10:09:19,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133657729] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:19,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:19,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-03-04 10:09:19,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998396497] [2025-03-04 10:09:19,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:19,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:09:19,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:19,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:09:19,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:09:23,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:09:23,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 66 [2025-03-04 10:09:23,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 154 transitions, 1198 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-04 10:09:23,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:23,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 66 [2025-03-04 10:09:23,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:24,667 INFO L124 PetriNetUnfolderBase]: 426/1083 cut-off events. [2025-03-04 10:09:24,668 INFO L125 PetriNetUnfolderBase]: For 556/578 co-relation queries the response was YES. [2025-03-04 10:09:24,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2972 conditions, 1083 events. 426/1083 cut-off events. For 556/578 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6664 event pairs, 171 based on Foata normal form. 0/963 useless extension candidates. Maximal degree in co-relation 2872. Up to 307 conditions per place. [2025-03-04 10:09:24,673 INFO L140 encePairwiseOnDemand]: 53/66 looper letters, 119 selfloop transitions, 71 changer transitions 0/208 dead transitions. [2025-03-04 10:09:24,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 208 transitions, 1787 flow [2025-03-04 10:09:24,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:09:24,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:09:24,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 330 transitions. [2025-03-04 10:09:24,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-04 10:09:24,675 INFO L175 Difference]: Start difference. First operand has 133 places, 154 transitions, 1198 flow. Second operand 9 states and 330 transitions. [2025-03-04 10:09:24,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 208 transitions, 1787 flow [2025-03-04 10:09:24,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 208 transitions, 1783 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-04 10:09:24,682 INFO L231 Difference]: Finished difference. Result has 143 places, 161 transitions, 1409 flow [2025-03-04 10:09:24,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1409, PETRI_PLACES=143, PETRI_TRANSITIONS=161} [2025-03-04 10:09:24,682 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 80 predicate places. [2025-03-04 10:09:24,682 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 161 transitions, 1409 flow [2025-03-04 10:09:24,682 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-04 10:09:24,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:24,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:24,689 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-04 10:09:24,887 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-04 10:09:24,887 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:09:24,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:24,887 INFO L85 PathProgramCache]: Analyzing trace with hash -585684637, now seen corresponding path program 1 times [2025-03-04 10:09:24,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:24,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836217054] [2025-03-04 10:09:24,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:24,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:24,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:09:24,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:09:24,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:24,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:24,970 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-04 10:09:24,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:24,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836217054] [2025-03-04 10:09:24,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836217054] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:24,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498502872] [2025-03-04 10:09:24,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:24,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:24,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:24,973 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:24,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:09:25,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:09:25,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:09:25,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:25,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:25,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:09:25,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:25,155 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-04 10:09:25,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:25,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-04 10:09:25,239 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-04 10:09:25,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498502872] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:25,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:25,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 10:09:25,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360294191] [2025-03-04 10:09:25,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:25,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:09:25,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:25,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:09:25,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:09:25,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-04 10:09:25,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 161 transitions, 1409 flow. Second operand has 9 states, 9 states have (on average 35.44444444444444) internal successors, (319), 9 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:25,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:25,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-04 10:09:25,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:25,859 INFO L124 PetriNetUnfolderBase]: 1120/2630 cut-off events. [2025-03-04 10:09:25,859 INFO L125 PetriNetUnfolderBase]: For 2641/2927 co-relation queries the response was YES. [2025-03-04 10:09:25,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7165 conditions, 2630 events. 1120/2630 cut-off events. For 2641/2927 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 18710 event pairs, 342 based on Foata normal form. 0/2328 useless extension candidates. Maximal degree in co-relation 7057. Up to 496 conditions per place. [2025-03-04 10:09:25,872 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 180 selfloop transitions, 48 changer transitions 0/247 dead transitions. [2025-03-04 10:09:25,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 247 transitions, 2301 flow [2025-03-04 10:09:25,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:09:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:09:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 480 transitions. [2025-03-04 10:09:25,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-03-04 10:09:25,873 INFO L175 Difference]: Start difference. First operand has 143 places, 161 transitions, 1409 flow. Second operand 12 states and 480 transitions. [2025-03-04 10:09:25,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 247 transitions, 2301 flow [2025-03-04 10:09:25,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 247 transitions, 2207 flow, removed 14 selfloop flow, removed 3 redundant places. [2025-03-04 10:09:25,882 INFO L231 Difference]: Finished difference. Result has 157 places, 173 transitions, 1526 flow [2025-03-04 10:09:25,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1526, PETRI_PLACES=157, PETRI_TRANSITIONS=173} [2025-03-04 10:09:25,883 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 94 predicate places. [2025-03-04 10:09:25,883 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 173 transitions, 1526 flow [2025-03-04 10:09:25,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 35.44444444444444) internal successors, (319), 9 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:25,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:25,883 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:25,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:26,085 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-04 10:09:26,085 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:09:26,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:26,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1420024820, now seen corresponding path program 1 times [2025-03-04 10:09:26,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:26,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218740498] [2025-03-04 10:09:26,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:26,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:26,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:09:26,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:09:26,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:26,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:26,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:26,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218740498] [2025-03-04 10:09:26,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218740498] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:26,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723902272] [2025-03-04 10:09:26,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:26,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:26,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:26,326 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:26,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:09:26,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:09:26,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:09:26,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:26,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:26,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 10:09:26,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:26,426 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-04 10:09:26,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:09:26,502 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 10:09:26,503 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-04 10:09:26,530 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 31 treesize of output 24 [2025-03-04 10:09:26,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:09:26,678 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:09:26,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2025-03-04 10:09:26,707 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 10:09:26,707 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 17 treesize of output 21 [2025-03-04 10:09:26,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:09:26,819 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-04 10:09:26,837 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-04 10:09:26,837 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-04 10:09:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:26,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:27,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723902272] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:27,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:27,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-03-04 10:09:27,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312495224] [2025-03-04 10:09:27,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:27,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:09:27,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:27,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:09:27,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:09:29,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 66 [2025-03-04 10:09:29,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 173 transitions, 1526 flow. Second operand has 17 states, 17 states have (on average 27.11764705882353) internal successors, (461), 17 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:29,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:29,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 66 [2025-03-04 10:09:29,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:30,528 INFO L124 PetriNetUnfolderBase]: 1027/2479 cut-off events. [2025-03-04 10:09:30,528 INFO L125 PetriNetUnfolderBase]: For 2598/2735 co-relation queries the response was YES. [2025-03-04 10:09:30,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7709 conditions, 2479 events. 1027/2479 cut-off events. For 2598/2735 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 17658 event pairs, 452 based on Foata normal form. 60/2339 useless extension candidates. Maximal degree in co-relation 7589. Up to 1029 conditions per place. [2025-03-04 10:09:30,540 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 132 selfloop transitions, 72 changer transitions 0/223 dead transitions. [2025-03-04 10:09:30,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 223 transitions, 2228 flow [2025-03-04 10:09:30,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:09:30,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 10:09:30,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 406 transitions. [2025-03-04 10:09:30,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4731934731934732 [2025-03-04 10:09:30,542 INFO L175 Difference]: Start difference. First operand has 157 places, 173 transitions, 1526 flow. Second operand 13 states and 406 transitions. [2025-03-04 10:09:30,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 223 transitions, 2228 flow [2025-03-04 10:09:30,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 223 transitions, 2156 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:09:30,554 INFO L231 Difference]: Finished difference. Result has 165 places, 174 transitions, 1666 flow [2025-03-04 10:09:30,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1666, PETRI_PLACES=165, PETRI_TRANSITIONS=174} [2025-03-04 10:09:30,554 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 102 predicate places. [2025-03-04 10:09:30,554 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 174 transitions, 1666 flow [2025-03-04 10:09:30,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 27.11764705882353) internal successors, (461), 17 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:30,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:30,555 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:30,561 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-04 10:09:30,759 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-04 10:09:30,759 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:09:30,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:30,759 INFO L85 PathProgramCache]: Analyzing trace with hash -976353992, now seen corresponding path program 1 times [2025-03-04 10:09:30,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:30,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733163330] [2025-03-04 10:09:30,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:30,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:30,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:09:30,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:09:30,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:30,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:09:30,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1844143637] [2025-03-04 10:09:30,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:30,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:30,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:30,782 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:30,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:09:30,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:09:30,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:09:30,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:30,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:30,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:09:30,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:31,003 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:31,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:31,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:31,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733163330] [2025-03-04 10:09:31,105 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:09:31,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844143637] [2025-03-04 10:09:31,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844143637] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:31,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:09:31,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-04 10:09:31,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69443854] [2025-03-04 10:09:31,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:31,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:09:31,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:31,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:09:31,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:09:31,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-04 10:09:31,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 174 transitions, 1666 flow. Second operand has 12 states, 12 states have (on average 36.5) internal successors, (438), 12 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:31,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:31,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-04 10:09:31,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:31,875 INFO L124 PetriNetUnfolderBase]: 1015/1984 cut-off events. [2025-03-04 10:09:31,875 INFO L125 PetriNetUnfolderBase]: For 7134/7662 co-relation queries the response was YES. [2025-03-04 10:09:31,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7755 conditions, 1984 events. 1015/1984 cut-off events. For 7134/7662 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 11074 event pairs, 528 based on Foata normal form. 60/1955 useless extension candidates. Maximal degree in co-relation 7635. Up to 820 conditions per place. [2025-03-04 10:09:31,885 INFO L140 encePairwiseOnDemand]: 51/66 looper letters, 84 selfloop transitions, 59 changer transitions 66/230 dead transitions. [2025-03-04 10:09:31,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 230 transitions, 2411 flow [2025-03-04 10:09:31,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:09:31,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:09:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 421 transitions. [2025-03-04 10:09:31,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6378787878787879 [2025-03-04 10:09:31,886 INFO L175 Difference]: Start difference. First operand has 165 places, 174 transitions, 1666 flow. Second operand 10 states and 421 transitions. [2025-03-04 10:09:31,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 230 transitions, 2411 flow [2025-03-04 10:09:31,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 230 transitions, 2316 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-04 10:09:31,897 INFO L231 Difference]: Finished difference. Result has 168 places, 144 transitions, 1439 flow [2025-03-04 10:09:31,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1561, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1439, PETRI_PLACES=168, PETRI_TRANSITIONS=144} [2025-03-04 10:09:31,897 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 105 predicate places. [2025-03-04 10:09:31,897 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 144 transitions, 1439 flow [2025-03-04 10:09:31,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 36.5) internal successors, (438), 12 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:31,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:31,898 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:31,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:32,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:32,099 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:09:32,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:32,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1155727463, now seen corresponding path program 1 times [2025-03-04 10:09:32,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:32,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871039661] [2025-03-04 10:09:32,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:32,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:32,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:09:32,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:09:32,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:32,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:32,210 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:09:32,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:32,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871039661] [2025-03-04 10:09:32,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871039661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:32,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913904592] [2025-03-04 10:09:32,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:32,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:32,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:32,212 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:32,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:09:32,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:09:32,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:09:32,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:32,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:32,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:09:32,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:09:32,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:09:32,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913904592] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:32,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:32,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 10:09:32,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417325775] [2025-03-04 10:09:32,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:32,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:09:32,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:32,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:09:32,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:09:32,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-04 10:09:32,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 144 transitions, 1439 flow. Second operand has 14 states, 14 states have (on average 36.214285714285715) internal successors, (507), 14 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:32,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:32,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-04 10:09:32,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:33,154 INFO L124 PetriNetUnfolderBase]: 1616/3309 cut-off events. [2025-03-04 10:09:33,155 INFO L125 PetriNetUnfolderBase]: For 7305/7417 co-relation queries the response was YES. [2025-03-04 10:09:33,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12435 conditions, 3309 events. 1616/3309 cut-off events. For 7305/7417 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 21439 event pairs, 684 based on Foata normal form. 78/3218 useless extension candidates. Maximal degree in co-relation 12330. Up to 1427 conditions per place. [2025-03-04 10:09:33,170 INFO L140 encePairwiseOnDemand]: 51/66 looper letters, 132 selfloop transitions, 68 changer transitions 19/240 dead transitions. [2025-03-04 10:09:33,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 240 transitions, 2640 flow [2025-03-04 10:09:33,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:09:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:09:33,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 460 transitions. [2025-03-04 10:09:33,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6336088154269972 [2025-03-04 10:09:33,172 INFO L175 Difference]: Start difference. First operand has 168 places, 144 transitions, 1439 flow. Second operand 11 states and 460 transitions. [2025-03-04 10:09:33,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 240 transitions, 2640 flow [2025-03-04 10:09:33,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 240 transitions, 2337 flow, removed 39 selfloop flow, removed 20 redundant places. [2025-03-04 10:09:33,191 INFO L231 Difference]: Finished difference. Result has 151 places, 157 transitions, 1628 flow [2025-03-04 10:09:33,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1251, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1628, PETRI_PLACES=151, PETRI_TRANSITIONS=157} [2025-03-04 10:09:33,192 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 88 predicate places. [2025-03-04 10:09:33,192 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 157 transitions, 1628 flow [2025-03-04 10:09:33,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 36.214285714285715) internal successors, (507), 14 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:33,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:33,193 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 2, 1, 1, 1, 1] [2025-03-04 10:09:33,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 10:09:33,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 10:09:33,393 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:09:33,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:33,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1128648685, now seen corresponding path program 3 times [2025-03-04 10:09:33,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:33,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441090443] [2025-03-04 10:09:33,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:09:33,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:33,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 7 equivalence classes. [2025-03-04 10:09:33,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 8 of 18 statements. [2025-03-04 10:09:33,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:09:33,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 10:09:33,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:33,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441090443] [2025-03-04 10:09:33,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441090443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:33,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088952912] [2025-03-04 10:09:33,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:09:33,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:33,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:33,622 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:33,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:09:33,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 7 equivalence classes. [2025-03-04 10:09:33,692 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 8 of 18 statements. [2025-03-04 10:09:33,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:09:33,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:33,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 10:09:33,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:33,709 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-04 10:09:33,872 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:09:33,872 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 25 treesize of output 22 [2025-03-04 10:09:33,999 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 10:09:34,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 10:09:34,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088952912] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:34,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:34,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-03-04 10:09:34,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140503014] [2025-03-04 10:09:34,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:34,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:09:34,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:34,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:09:34,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:09:35,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-04 10:09:35,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 157 transitions, 1628 flow. Second operand has 17 states, 17 states have (on average 33.588235294117645) internal successors, (571), 17 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:35,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:35,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-04 10:09:35,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:36,456 INFO L124 PetriNetUnfolderBase]: 945/2155 cut-off events. [2025-03-04 10:09:36,456 INFO L125 PetriNetUnfolderBase]: For 4694/4972 co-relation queries the response was YES. [2025-03-04 10:09:36,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7748 conditions, 2155 events. 945/2155 cut-off events. For 4694/4972 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 14482 event pairs, 492 based on Foata normal form. 5/1982 useless extension candidates. Maximal degree in co-relation 7507. Up to 1429 conditions per place. [2025-03-04 10:09:36,466 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 55 selfloop transitions, 80 changer transitions 0/156 dead transitions. [2025-03-04 10:09:36,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 156 transitions, 1882 flow [2025-03-04 10:09:36,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:09:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:09:36,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 362 transitions. [2025-03-04 10:09:36,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5484848484848485 [2025-03-04 10:09:36,469 INFO L175 Difference]: Start difference. First operand has 151 places, 157 transitions, 1628 flow. Second operand 10 states and 362 transitions. [2025-03-04 10:09:36,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 156 transitions, 1882 flow [2025-03-04 10:09:36,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 156 transitions, 1775 flow, removed 2 selfloop flow, removed 12 redundant places. [2025-03-04 10:09:36,479 INFO L231 Difference]: Finished difference. Result has 147 places, 156 transitions, 1665 flow [2025-03-04 10:09:36,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1505, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1665, PETRI_PLACES=147, PETRI_TRANSITIONS=156} [2025-03-04 10:09:36,480 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 84 predicate places. [2025-03-04 10:09:36,480 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 156 transitions, 1665 flow [2025-03-04 10:09:36,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 33.588235294117645) internal successors, (571), 17 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:36,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:36,480 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:36,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:09:36,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:36,681 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-04 10:09:36,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:36,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1886977167, now seen corresponding path program 1 times [2025-03-04 10:09:36,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:36,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725774246] [2025-03-04 10:09:36,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:36,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:36,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:09:36,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:09:36,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:36,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:09:36,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1300340037] [2025-03-04 10:09:36,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:36,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:36,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:36,710 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:36,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:09:36,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:09:36,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:09:36,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:36,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:36,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 10:09:36,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:36,810 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-04 10:09:36,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:09:36,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:09:36,872 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:09:36,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:09:36,907 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:09:36,907 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-04 10:09:37,040 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:09:37,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:37,307 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 46 treesize of output 42 [2025-03-04 10:09:37,370 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:09:37,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:37,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725774246] [2025-03-04 10:09:37,370 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:09:37,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300340037] [2025-03-04 10:09:37,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300340037] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:37,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:09:37,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2025-03-04 10:09:37,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63390728] [2025-03-04 10:09:37,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:37,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:09:37,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:37,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:09:37,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:09:41,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-03-04 10:09:45,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-03-04 10:09:49,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-03-04 10:09:53,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-03-04 10:09:57,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-03-04 10:10:01,745 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 [1]