./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-word-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/chl-word-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:03:58,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:03:58,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:03:58,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:03:58,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:03:58,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:03:58,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:03:58,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:03:58,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:03:58,130 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:03:58,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:03:58,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:03:58,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:03:58,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:03:58,135 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:03:58,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:03:58,135 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:03:58,135 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:03:58,135 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:03:58,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:03:58,135 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:03:58,135 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:03:58,135 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:03:58,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:03:58,135 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:03:58,135 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:03:58,135 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:03:58,135 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:03:58,135 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:03:58,135 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:03:58,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:03:58,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:03:58,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:03:58,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:03:58,136 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:03:58,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:03:58,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:03:58,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:03:58,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:03:58,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:03:58,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:03:58,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:03:58,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:03:58,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:03:58,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:03:58,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:03:58,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:03:58,136 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-jdk21/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 -> bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e [2025-01-10 01:03:58,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:03:58,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:03:58,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:03:58,413 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:03:58,413 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:03:58,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2025-01-10 01:03:59,506 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3d838a1f/a7dd004930be469c86c3e0b41ea5a6c4/FLAGf2a9e17dc [2025-01-10 01:03:59,790 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:03:59,790 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2025-01-10 01:03:59,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3d838a1f/a7dd004930be469c86c3e0b41ea5a6c4/FLAGf2a9e17dc [2025-01-10 01:04:00,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3d838a1f/a7dd004930be469c86c3e0b41ea5a6c4 [2025-01-10 01:04:00,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:04:00,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:04:00,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:04:00,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:04:00,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:04:00,108 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:04:00" (1/1) ... [2025-01-10 01:04:00,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5198b879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:00, skipping insertion in model container [2025-01-10 01:04:00,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:04:00" (1/1) ... [2025-01-10 01:04:00,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:04:00,256 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:04:00,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:04:00,264 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:04:00,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:04:00,293 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:04:00,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:00 WrapperNode [2025-01-10 01:04:00,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:04:00,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:04:00,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:04:00,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:04:00,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:00" (1/1) ... [2025-01-10 01:04:00,307 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:00" (1/1) ... [2025-01-10 01:04:00,321 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 119 [2025-01-10 01:04:00,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:04:00,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:04:00,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:04:00,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:04:00,328 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:00" (1/1) ... [2025-01-10 01:04:00,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:00" (1/1) ... [2025-01-10 01:04:00,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:00" (1/1) ... [2025-01-10 01:04:00,340 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-01-10 01:04:00,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:00" (1/1) ... [2025-01-10 01:04:00,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:00" (1/1) ... [2025-01-10 01:04:00,345 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:00" (1/1) ... [2025-01-10 01:04:00,346 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:00" (1/1) ... [2025-01-10 01:04:00,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:00" (1/1) ... [2025-01-10 01:04:00,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:00" (1/1) ... [2025-01-10 01:04:00,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:00" (1/1) ... [2025-01-10 01:04:00,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:04:00,352 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:04:00,352 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:04:00,352 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:04:00,353 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:00" (1/1) ... [2025-01-10 01:04:00,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:04:00,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:04:00,390 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:04:00,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:04:00,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:04:00,413 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:04:00,413 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:04:00,413 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:04:00,413 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:04:00,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:04:00,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:04:00,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:04:00,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:04:00,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:04:00,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:04:00,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:04:00,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:04:00,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:04:00,415 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:04:00,480 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:04:00,481 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:04:00,782 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:04:00,783 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:04:00,945 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:04:00,945 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:04:00,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:04:00 BoogieIcfgContainer [2025-01-10 01:04:00,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:04:00,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:04:00,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:04:00,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:04:00,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:04:00" (1/3) ... [2025-01-10 01:04:00,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ceacad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:04:00, skipping insertion in model container [2025-01-10 01:04:00,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:00" (2/3) ... [2025-01-10 01:04:00,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ceacad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:04:00, skipping insertion in model container [2025-01-10 01:04:00,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:04:00" (3/3) ... [2025-01-10 01:04:00,952 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-symm.wvr.c [2025-01-10 01:04:00,961 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:04:00,962 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-symm.wvr.c that has 3 procedures, 59 locations, 1 initial locations, 4 loop locations, and 22 error locations. [2025-01-10 01:04:00,962 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:04:01,016 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:04:01,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 66 transitions, 146 flow [2025-01-10 01:04:01,064 INFO L124 PetriNetUnfolderBase]: 8/64 cut-off events. [2025-01-10 01:04:01,066 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:04:01,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 64 events. 8/64 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 176 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-01-10 01:04:01,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 66 transitions, 146 flow [2025-01-10 01:04:01,070 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 63 transitions, 138 flow [2025-01-10 01:04:01,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:04:01,087 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;@45e88aad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:04:01,087 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-01-10 01:04:01,090 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:04:01,090 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:04:01,090 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:04:01,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:01,092 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:04:01,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:04:01,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:01,096 INFO L85 PathProgramCache]: Analyzing trace with hash 557830, now seen corresponding path program 1 times [2025-01-10 01:04:01,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:01,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613189508] [2025-01-10 01:04:01,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:01,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:01,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:04:01,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:04:01,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:01,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:01,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:01,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:01,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613189508] [2025-01-10 01:04:01,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613189508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:01,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:01,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:04:01,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506137124] [2025-01-10 01:04:01,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:01,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:04:01,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:01,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:04:01,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:04:01,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-01-10 01:04:01,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 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-01-10 01:04:01,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:01,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-01-10 01:04:01,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:01,490 INFO L124 PetriNetUnfolderBase]: 208/505 cut-off events. [2025-01-10 01:04:01,490 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-10 01:04:01,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 850 conditions, 505 events. 208/505 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2695 event pairs, 117 based on Foata normal form. 1/322 useless extension candidates. Maximal degree in co-relation 784. Up to 315 conditions per place. [2025-01-10 01:04:01,495 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 28 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2025-01-10 01:04:01,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 190 flow [2025-01-10 01:04:01,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:04:01,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:04:01,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2025-01-10 01:04:01,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-01-10 01:04:01,505 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 138 flow. Second operand 3 states and 129 transitions. [2025-01-10 01:04:01,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 190 flow [2025-01-10 01:04:01,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 182 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:04:01,509 INFO L231 Difference]: Finished difference. Result has 56 places, 59 transitions, 126 flow [2025-01-10 01:04:01,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=56, PETRI_TRANSITIONS=59} [2025-01-10 01:04:01,513 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-01-10 01:04:01,513 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 59 transitions, 126 flow [2025-01-10 01:04:01,513 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-01-10 01:04:01,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:01,513 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:04:01,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:04:01,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:04:01,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:01,514 INFO L85 PathProgramCache]: Analyzing trace with hash 557831, now seen corresponding path program 1 times [2025-01-10 01:04:01,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:01,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043876823] [2025-01-10 01:04:01,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:01,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:01,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:04:01,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:04:01,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:01,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:01,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:01,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:01,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043876823] [2025-01-10 01:04:01,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043876823] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:01,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:01,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:04:01,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336564639] [2025-01-10 01:04:01,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:01,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:04:01,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:01,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:04:01,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:04:01,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-01-10 01:04:01,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 59 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:01,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:01,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-01-10 01:04:01,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:01,970 INFO L124 PetriNetUnfolderBase]: 209/508 cut-off events. [2025-01-10 01:04:01,971 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:04:01,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 508 events. 209/508 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2699 event pairs, 117 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 816. Up to 324 conditions per place. [2025-01-10 01:04:01,975 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 31 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2025-01-10 01:04:01,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 202 flow [2025-01-10 01:04:01,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:04:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:04:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2025-01-10 01:04:01,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2025-01-10 01:04:01,977 INFO L175 Difference]: Start difference. First operand has 56 places, 59 transitions, 126 flow. Second operand 4 states and 164 transitions. [2025-01-10 01:04:01,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 202 flow [2025-01-10 01:04:01,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 62 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:04:01,979 INFO L231 Difference]: Finished difference. Result has 59 places, 62 transitions, 149 flow [2025-01-10 01:04:01,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=59, PETRI_TRANSITIONS=62} [2025-01-10 01:04:01,980 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2025-01-10 01:04:01,980 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 62 transitions, 149 flow [2025-01-10 01:04:01,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:01,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:01,981 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:04:01,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:04:01,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:04:01,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:01,982 INFO L85 PathProgramCache]: Analyzing trace with hash 17293423, now seen corresponding path program 1 times [2025-01-10 01:04:01,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:01,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038162676] [2025-01-10 01:04:01,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:01,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:01,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:04:02,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:04:02,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:02,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:02,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:02,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:02,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038162676] [2025-01-10 01:04:02,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038162676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:02,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:02,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:04:02,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297521804] [2025-01-10 01:04:02,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:02,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:04:02,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:02,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:04:02,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:04:02,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-01-10 01:04:02,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 62 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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-01-10 01:04:02,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:02,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-01-10 01:04:02,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:02,554 INFO L124 PetriNetUnfolderBase]: 210/511 cut-off events. [2025-01-10 01:04:02,555 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:04:02,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 511 events. 210/511 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2724 event pairs, 117 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 837. Up to 323 conditions per place. [2025-01-10 01:04:02,559 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 31 selfloop transitions, 7 changer transitions 0/65 dead transitions. [2025-01-10 01:04:02,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 65 transitions, 231 flow [2025-01-10 01:04:02,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:04:02,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:04:02,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 199 transitions. [2025-01-10 01:04:02,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.603030303030303 [2025-01-10 01:04:02,561 INFO L175 Difference]: Start difference. First operand has 59 places, 62 transitions, 149 flow. Second operand 5 states and 199 transitions. [2025-01-10 01:04:02,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 65 transitions, 231 flow [2025-01-10 01:04:02,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 65 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:04:02,562 INFO L231 Difference]: Finished difference. Result has 64 places, 65 transitions, 183 flow [2025-01-10 01:04:02,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=58, 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=183, PETRI_PLACES=64, PETRI_TRANSITIONS=65} [2025-01-10 01:04:02,563 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2025-01-10 01:04:02,563 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 65 transitions, 183 flow [2025-01-10 01:04:02,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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-01-10 01:04:02,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:02,563 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:04:02,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:04:02,566 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:04:02,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:02,567 INFO L85 PathProgramCache]: Analyzing trace with hash 536093340, now seen corresponding path program 1 times [2025-01-10 01:04:02,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:02,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38105471] [2025-01-10 01:04:02,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:02,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:02,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:04:02,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:04:02,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:02,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:02,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:02,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:02,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38105471] [2025-01-10 01:04:02,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38105471] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:04:02,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514967739] [2025-01-10 01:04:02,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:02,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:04:02,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:04:02,811 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:04:02,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:04:02,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:04:02,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:04:02,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:02,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:02,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:04:02,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:04:02,926 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-01-10 01:04:03,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:03,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:04:03,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:03,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514967739] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:04:03,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:04:03,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:04:03,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807076878] [2025-01-10 01:04:03,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:04:03,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:04:03,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:03,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:04:03,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:04:03,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-01-10 01:04:03,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 65 transitions, 183 flow. Second operand has 11 states, 11 states have (on average 33.36363636363637) internal successors, (367), 11 states have internal predecessors, (367), 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-01-10 01:04:03,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:03,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-01-10 01:04:03,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:03,816 INFO L124 PetriNetUnfolderBase]: 210/510 cut-off events. [2025-01-10 01:04:03,816 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 01:04:03,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 510 events. 210/510 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2719 event pairs, 117 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 847. Up to 323 conditions per place. [2025-01-10 01:04:03,818 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 30 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2025-01-10 01:04:03,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 253 flow [2025-01-10 01:04:03,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:04:03,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:04:03,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 227 transitions. [2025-01-10 01:04:03,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5732323232323232 [2025-01-10 01:04:03,820 INFO L175 Difference]: Start difference. First operand has 64 places, 65 transitions, 183 flow. Second operand 6 states and 227 transitions. [2025-01-10 01:04:03,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 253 flow [2025-01-10 01:04:03,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 64 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:04:03,825 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 192 flow [2025-01-10 01:04:03,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2025-01-10 01:04:03,826 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2025-01-10 01:04:03,826 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 192 flow [2025-01-10 01:04:03,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 33.36363636363637) internal successors, (367), 11 states have internal predecessors, (367), 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-01-10 01:04:03,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:03,826 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 01:04:03,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:04:04,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:04:04,027 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:04:04,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:04,028 INFO L85 PathProgramCache]: Analyzing trace with hash -560872155, now seen corresponding path program 1 times [2025-01-10 01:04:04,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:04,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275493486] [2025-01-10 01:04:04,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:04,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:04,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:04:04,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:04:04,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:04,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:04,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:04,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:04,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275493486] [2025-01-10 01:04:04,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275493486] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:04:04,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52591555] [2025-01-10 01:04:04,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:04,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:04:04,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:04:04,277 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:04:04,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:04:04,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:04:04,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:04:04,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:04,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:04,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:04:04,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:04:04,361 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-01-10 01:04:04,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:04,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:04:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:04,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52591555] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:04:04,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:04:04,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:04:04,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114916028] [2025-01-10 01:04:04,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:04:04,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:04:04,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:04,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:04:04,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:04:04,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-01-10 01:04:04,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 192 flow. Second operand has 13 states, 13 states have (on average 33.30769230769231) internal successors, (433), 13 states have internal predecessors, (433), 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-01-10 01:04:04,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:04,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-01-10 01:04:04,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:05,144 INFO L124 PetriNetUnfolderBase]: 210/509 cut-off events. [2025-01-10 01:04:05,144 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 01:04:05,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 509 events. 210/509 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2705 event pairs, 117 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 846. Up to 315 conditions per place. [2025-01-10 01:04:05,147 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 24 selfloop transitions, 12 changer transitions 0/63 dead transitions. [2025-01-10 01:04:05,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 63 transitions, 260 flow [2025-01-10 01:04:05,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:04:05,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:04:05,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 261 transitions. [2025-01-10 01:04:05,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.564935064935065 [2025-01-10 01:04:05,152 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 192 flow. Second operand 7 states and 261 transitions. [2025-01-10 01:04:05,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 63 transitions, 260 flow [2025-01-10 01:04:05,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 226 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-01-10 01:04:05,153 INFO L231 Difference]: Finished difference. Result has 64 places, 63 transitions, 178 flow [2025-01-10 01:04:05,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=178, PETRI_PLACES=64, PETRI_TRANSITIONS=63} [2025-01-10 01:04:05,154 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2025-01-10 01:04:05,154 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 178 flow [2025-01-10 01:04:05,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 33.30769230769231) internal successors, (433), 13 states have internal predecessors, (433), 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-01-10 01:04:05,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:05,154 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:05,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:04:05,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:04:05,359 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:04:05,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:05,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2088750467, now seen corresponding path program 1 times [2025-01-10 01:04:05,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:05,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958038588] [2025-01-10 01:04:05,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:05,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:05,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:04:05,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:04:05,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:05,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:05,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:05,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:05,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958038588] [2025-01-10 01:04:05,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958038588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:05,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:05,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:04:05,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663775890] [2025-01-10 01:04:05,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:05,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:04:05,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:05,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:04:05,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:04:05,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2025-01-10 01:04:05,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 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-01-10 01:04:05,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:05,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2025-01-10 01:04:05,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:05,591 INFO L124 PetriNetUnfolderBase]: 364/941 cut-off events. [2025-01-10 01:04:05,592 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-01-10 01:04:05,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1575 conditions, 941 events. 364/941 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6002 event pairs, 198 based on Foata normal form. 16/633 useless extension candidates. Maximal degree in co-relation 958. Up to 357 conditions per place. [2025-01-10 01:04:05,596 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 69 selfloop transitions, 5 changer transitions 0/100 dead transitions. [2025-01-10 01:04:05,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 100 transitions, 431 flow [2025-01-10 01:04:05,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:04:05,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:04:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 234 transitions. [2025-01-10 01:04:05,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7090909090909091 [2025-01-10 01:04:05,598 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 178 flow. Second operand 5 states and 234 transitions. [2025-01-10 01:04:05,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 100 transitions, 431 flow [2025-01-10 01:04:05,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 100 transitions, 392 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-01-10 01:04:05,600 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 178 flow [2025-01-10 01:04:05,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2025-01-10 01:04:05,601 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2025-01-10 01:04:05,601 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 178 flow [2025-01-10 01:04:05,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 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-01-10 01:04:05,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:05,601 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:05,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:04:05,601 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:04:05,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:05,602 INFO L85 PathProgramCache]: Analyzing trace with hash -280885240, now seen corresponding path program 1 times [2025-01-10 01:04:05,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:05,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576370487] [2025-01-10 01:04:05,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:05,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:05,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:04:05,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:04:05,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:05,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:05,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:04:05,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:05,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576370487] [2025-01-10 01:04:05,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576370487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:05,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:05,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:04:05,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710856476] [2025-01-10 01:04:05,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:05,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:04:05,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:05,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:04:05,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:04:05,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2025-01-10 01:04:05,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 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-01-10 01:04:05,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:05,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2025-01-10 01:04:05,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:05,910 INFO L124 PetriNetUnfolderBase]: 626/1644 cut-off events. [2025-01-10 01:04:05,911 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2025-01-10 01:04:05,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2898 conditions, 1644 events. 626/1644 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12291 event pairs, 343 based on Foata normal form. 16/1153 useless extension candidates. Maximal degree in co-relation 1981. Up to 573 conditions per place. [2025-01-10 01:04:05,918 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 64 selfloop transitions, 8 changer transitions 0/98 dead transitions. [2025-01-10 01:04:05,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 98 transitions, 405 flow [2025-01-10 01:04:05,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:04:05,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:04:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 231 transitions. [2025-01-10 01:04:05,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-01-10 01:04:05,919 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 178 flow. Second operand 5 states and 231 transitions. [2025-01-10 01:04:05,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 98 transitions, 405 flow [2025-01-10 01:04:05,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 98 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:04:05,921 INFO L231 Difference]: Finished difference. Result has 69 places, 69 transitions, 228 flow [2025-01-10 01:04:05,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=69, PETRI_TRANSITIONS=69} [2025-01-10 01:04:05,922 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2025-01-10 01:04:05,922 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 228 flow [2025-01-10 01:04:05,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 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-01-10 01:04:05,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:05,923 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:05,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:04:05,923 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:04:05,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:05,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1527880245, now seen corresponding path program 1 times [2025-01-10 01:04:05,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:05,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103355101] [2025-01-10 01:04:05,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:05,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:05,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:04:05,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:04:05,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:05,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:04:05,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:05,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103355101] [2025-01-10 01:04:05,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103355101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:05,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:05,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:04:05,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050143708] [2025-01-10 01:04:05,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:05,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:04:05,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:05,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:04:05,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:04:06,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 66 [2025-01-10 01:04:06,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-01-10 01:04:06,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:06,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 66 [2025-01-10 01:04:06,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:06,178 INFO L124 PetriNetUnfolderBase]: 762/1772 cut-off events. [2025-01-10 01:04:06,178 INFO L125 PetriNetUnfolderBase]: For 944/952 co-relation queries the response was YES. [2025-01-10 01:04:06,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3534 conditions, 1772 events. 762/1772 cut-off events. For 944/952 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12077 event pairs, 499 based on Foata normal form. 0/1415 useless extension candidates. Maximal degree in co-relation 2285. Up to 1213 conditions per place. [2025-01-10 01:04:06,186 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 42 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2025-01-10 01:04:06,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 65 transitions, 310 flow [2025-01-10 01:04:06,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:04:06,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:04:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2025-01-10 01:04:06,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5189393939393939 [2025-01-10 01:04:06,187 INFO L175 Difference]: Start difference. First operand has 69 places, 69 transitions, 228 flow. Second operand 4 states and 137 transitions. [2025-01-10 01:04:06,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 65 transitions, 310 flow [2025-01-10 01:04:06,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 65 transitions, 307 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:04:06,189 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 223 flow [2025-01-10 01:04:06,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=223, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2025-01-10 01:04:06,190 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2025-01-10 01:04:06,190 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 223 flow [2025-01-10 01:04:06,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-01-10 01:04:06,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:06,190 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:06,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:04:06,190 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:04:06,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:06,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1527880244, now seen corresponding path program 1 times [2025-01-10 01:04:06,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:06,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762317323] [2025-01-10 01:04:06,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:06,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:06,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:04:06,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:04:06,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:06,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:06,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:06,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:06,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762317323] [2025-01-10 01:04:06,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762317323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:06,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:06,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:04:06,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669315935] [2025-01-10 01:04:06,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:06,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:04:06,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:06,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:04:06,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:04:06,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2025-01-10 01:04:06,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 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-01-10 01:04:06,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:06,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2025-01-10 01:04:06,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:06,497 INFO L124 PetriNetUnfolderBase]: 554/1234 cut-off events. [2025-01-10 01:04:06,497 INFO L125 PetriNetUnfolderBase]: For 702/714 co-relation queries the response was YES. [2025-01-10 01:04:06,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2570 conditions, 1234 events. 554/1234 cut-off events. For 702/714 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 7281 event pairs, 333 based on Foata normal form. 22/1010 useless extension candidates. Maximal degree in co-relation 1742. Up to 588 conditions per place. [2025-01-10 01:04:06,503 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 68 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2025-01-10 01:04:06,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 95 transitions, 482 flow [2025-01-10 01:04:06,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:04:06,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:04:06,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2025-01-10 01:04:06,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6878787878787879 [2025-01-10 01:04:06,505 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 223 flow. Second operand 5 states and 227 transitions. [2025-01-10 01:04:06,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 95 transitions, 482 flow [2025-01-10 01:04:06,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 95 transitions, 476 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:04:06,508 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 244 flow [2025-01-10 01:04:06,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2025-01-10 01:04:06,508 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 9 predicate places. [2025-01-10 01:04:06,508 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 244 flow [2025-01-10 01:04:06,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 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-01-10 01:04:06,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:06,509 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:06,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:04:06,510 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:04:06,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:06,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1910543618, now seen corresponding path program 1 times [2025-01-10 01:04:06,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:06,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334791734] [2025-01-10 01:04:06,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:06,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:06,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:04:06,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:04:06,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:06,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:06,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-01-10 01:04:06,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:06,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334791734] [2025-01-10 01:04:06,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334791734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:06,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:06,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:04:06,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159487967] [2025-01-10 01:04:06,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:06,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:04:06,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:06,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:04:06,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:04:06,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 66 [2025-01-10 01:04:06,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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-01-10 01:04:06,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:06,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 66 [2025-01-10 01:04:06,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:06,779 INFO L124 PetriNetUnfolderBase]: 607/1307 cut-off events. [2025-01-10 01:04:06,780 INFO L125 PetriNetUnfolderBase]: For 864/878 co-relation queries the response was YES. [2025-01-10 01:04:06,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2908 conditions, 1307 events. 607/1307 cut-off events. For 864/878 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7545 event pairs, 402 based on Foata normal form. 0/1187 useless extension candidates. Maximal degree in co-relation 1932. Up to 980 conditions per place. [2025-01-10 01:04:06,785 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 42 selfloop transitions, 5 changer transitions 0/63 dead transitions. [2025-01-10 01:04:06,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 330 flow [2025-01-10 01:04:06,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:04:06,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:04:06,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2025-01-10 01:04:06,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-01-10 01:04:06,786 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 244 flow. Second operand 5 states and 162 transitions. [2025-01-10 01:04:06,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 330 flow [2025-01-10 01:04:06,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 63 transitions, 325 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:04:06,789 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 241 flow [2025-01-10 01:04:06,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2025-01-10 01:04:06,791 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2025-01-10 01:04:06,791 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 241 flow [2025-01-10 01:04:06,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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-01-10 01:04:06,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:06,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:06,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:04:06,792 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:04:06,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:06,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1910543617, now seen corresponding path program 1 times [2025-01-10 01:04:06,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:06,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270621736] [2025-01-10 01:04:06,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:06,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:06,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:04:06,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:04:06,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:06,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:06,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:04:06,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:06,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270621736] [2025-01-10 01:04:06,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270621736] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:04:06,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413295992] [2025-01-10 01:04:06,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:06,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:04:06,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:04:06,942 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:04:06,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:04:06,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:04:06,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:04:06,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:06,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:06,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:04:06,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:04:06,997 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-01-10 01:04:07,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:04:07,040 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-01-10 01:04:07,053 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:04:07,054 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-01-10 01:04:07,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:04:07,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:04:07,173 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 52 treesize of output 48 [2025-01-10 01:04:07,222 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:04:07,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413295992] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:04:07,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:04:07,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 01:04:07,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643465649] [2025-01-10 01:04:07,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:04:07,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:04:07,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:07,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:04:07,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:04:11,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:04:15,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:04:19,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:04:23,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:04:27,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:04:31,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:04:35,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:04:39,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:04:39,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-01-10 01:04:39,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 241 flow. Second operand has 11 states, 11 states have (on average 23.90909090909091) internal successors, (263), 11 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:39,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:39,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-01-10 01:04:39,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:40,182 INFO L124 PetriNetUnfolderBase]: 751/1555 cut-off events. [2025-01-10 01:04:40,182 INFO L125 PetriNetUnfolderBase]: For 930/958 co-relation queries the response was YES. [2025-01-10 01:04:40,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3469 conditions, 1555 events. 751/1555 cut-off events. For 930/958 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8822 event pairs, 312 based on Foata normal form. 0/1370 useless extension candidates. Maximal degree in co-relation 2292. Up to 472 conditions per place. [2025-01-10 01:04:40,189 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 78 selfloop transitions, 17 changer transitions 0/110 dead transitions. [2025-01-10 01:04:40,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 110 transitions, 569 flow [2025-01-10 01:04:40,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:04:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:04:40,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 292 transitions. [2025-01-10 01:04:40,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49158249158249157 [2025-01-10 01:04:40,191 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 241 flow. Second operand 9 states and 292 transitions. [2025-01-10 01:04:40,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 110 transitions, 569 flow [2025-01-10 01:04:40,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 110 transitions, 559 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:04:40,195 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 322 flow [2025-01-10 01:04:40,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=322, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2025-01-10 01:04:40,195 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 13 predicate places. [2025-01-10 01:04:40,196 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 322 flow [2025-01-10 01:04:40,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 23.90909090909091) internal successors, (263), 11 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:40,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:40,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:40,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:04:40,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:04:40,397 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:04:40,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:40,397 INFO L85 PathProgramCache]: Analyzing trace with hash 663815319, now seen corresponding path program 1 times [2025-01-10 01:04:40,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:40,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733157389] [2025-01-10 01:04:40,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:40,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:40,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:04:40,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:04:40,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:40,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:40,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:04:40,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:40,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733157389] [2025-01-10 01:04:40,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733157389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:40,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:40,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:04:40,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738416862] [2025-01-10 01:04:40,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:40,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:04:40,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:40,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:04:40,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:04:40,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2025-01-10 01:04:40,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 322 flow. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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-01-10 01:04:40,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:40,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2025-01-10 01:04:40,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:40,703 INFO L124 PetriNetUnfolderBase]: 613/1276 cut-off events. [2025-01-10 01:04:40,704 INFO L125 PetriNetUnfolderBase]: For 1740/1790 co-relation queries the response was YES. [2025-01-10 01:04:40,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3182 conditions, 1276 events. 613/1276 cut-off events. For 1740/1790 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6881 event pairs, 368 based on Foata normal form. 15/1161 useless extension candidates. Maximal degree in co-relation 2208. Up to 675 conditions per place. [2025-01-10 01:04:40,713 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 67 selfloop transitions, 10 changer transitions 0/95 dead transitions. [2025-01-10 01:04:40,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 95 transitions, 581 flow [2025-01-10 01:04:40,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:04:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:04:40,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2025-01-10 01:04:40,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6787878787878788 [2025-01-10 01:04:40,719 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 322 flow. Second operand 5 states and 224 transitions. [2025-01-10 01:04:40,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 95 transitions, 581 flow [2025-01-10 01:04:40,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 95 transitions, 561 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-01-10 01:04:40,723 INFO L231 Difference]: Finished difference. Result has 79 places, 73 transitions, 366 flow [2025-01-10 01:04:40,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=366, PETRI_PLACES=79, PETRI_TRANSITIONS=73} [2025-01-10 01:04:40,724 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 17 predicate places. [2025-01-10 01:04:40,724 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 73 transitions, 366 flow [2025-01-10 01:04:40,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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-01-10 01:04:40,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:40,724 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:40,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:04:40,724 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:04:40,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:40,725 INFO L85 PathProgramCache]: Analyzing trace with hash 902690534, now seen corresponding path program 1 times [2025-01-10 01:04:40,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:40,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091671619] [2025-01-10 01:04:40,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:40,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:40,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:04:40,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:04:40,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:40,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:04:40,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:40,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091671619] [2025-01-10 01:04:40,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091671619] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:04:40,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626315559] [2025-01-10 01:04:40,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:40,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:04:40,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:04:40,906 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:04:40,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:04:40,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:04:40,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:04:40,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:40,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:40,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:04:40,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:04:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:04:41,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:04:41,072 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-01-10 01:04:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:04:41,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626315559] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:04:41,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:04:41,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 01:04:41,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968281845] [2025-01-10 01:04:41,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:04:41,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:04:41,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:41,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:04:41,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:04:41,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 66 [2025-01-10 01:04:41,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 73 transitions, 366 flow. Second operand has 11 states, 11 states have (on average 32.90909090909091) internal successors, (362), 11 states have internal predecessors, (362), 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-01-10 01:04:41,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:41,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 66 [2025-01-10 01:04:41,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:41,722 INFO L124 PetriNetUnfolderBase]: 656/1328 cut-off events. [2025-01-10 01:04:41,722 INFO L125 PetriNetUnfolderBase]: For 1674/1712 co-relation queries the response was YES. [2025-01-10 01:04:41,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3408 conditions, 1328 events. 656/1328 cut-off events. For 1674/1712 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6952 event pairs, 297 based on Foata normal form. 2/1248 useless extension candidates. Maximal degree in co-relation 2349. Up to 429 conditions per place. [2025-01-10 01:04:41,728 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 79 selfloop transitions, 17 changer transitions 0/112 dead transitions. [2025-01-10 01:04:41,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 112 transitions, 670 flow [2025-01-10 01:04:41,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:04:41,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:04:41,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 303 transitions. [2025-01-10 01:04:41,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6558441558441559 [2025-01-10 01:04:41,730 INFO L175 Difference]: Start difference. First operand has 79 places, 73 transitions, 366 flow. Second operand 7 states and 303 transitions. [2025-01-10 01:04:41,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 112 transitions, 670 flow [2025-01-10 01:04:41,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 112 transitions, 660 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:04:41,736 INFO L231 Difference]: Finished difference. Result has 84 places, 73 transitions, 409 flow [2025-01-10 01:04:41,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=409, PETRI_PLACES=84, PETRI_TRANSITIONS=73} [2025-01-10 01:04:41,736 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 22 predicate places. [2025-01-10 01:04:41,737 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 73 transitions, 409 flow [2025-01-10 01:04:41,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.90909090909091) internal successors, (362), 11 states have internal predecessors, (362), 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-01-10 01:04:41,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:41,737 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:41,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:04:41,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 01:04:41,938 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:04:41,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:41,939 INFO L85 PathProgramCache]: Analyzing trace with hash -2069790195, now seen corresponding path program 1 times [2025-01-10 01:04:41,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:41,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411605573] [2025-01-10 01:04:41,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:41,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:41,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:04:41,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:04:41,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:41,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:42,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:04:42,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:42,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411605573] [2025-01-10 01:04:42,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411605573] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:04:42,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154048145] [2025-01-10 01:04:42,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:42,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:04:42,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:04:42,089 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:04:42,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:04:42,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:04:42,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:04:42,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:42,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:42,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:04:42,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:04:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:04:42,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:04:42,231 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-01-10 01:04:42,237 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:04:42,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154048145] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:04:42,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:04:42,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 01:04:42,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206932054] [2025-01-10 01:04:42,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:04:42,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:04:42,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:42,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:04:42,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:04:42,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2025-01-10 01:04:42,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 73 transitions, 409 flow. Second operand has 11 states, 11 states have (on average 32.27272727272727) internal successors, (355), 11 states have internal predecessors, (355), 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-01-10 01:04:42,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:42,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2025-01-10 01:04:42,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:42,879 INFO L124 PetriNetUnfolderBase]: 925/1789 cut-off events. [2025-01-10 01:04:42,880 INFO L125 PetriNetUnfolderBase]: For 4866/5116 co-relation queries the response was YES. [2025-01-10 01:04:42,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4995 conditions, 1789 events. 925/1789 cut-off events. For 4866/5116 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 9586 event pairs, 355 based on Foata normal form. 18/1690 useless extension candidates. Maximal degree in co-relation 3361. Up to 590 conditions per place. [2025-01-10 01:04:42,889 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 88 selfloop transitions, 17 changer transitions 0/120 dead transitions. [2025-01-10 01:04:42,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 120 transitions, 841 flow [2025-01-10 01:04:42,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:04:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:04:42,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 296 transitions. [2025-01-10 01:04:42,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6406926406926406 [2025-01-10 01:04:42,890 INFO L175 Difference]: Start difference. First operand has 84 places, 73 transitions, 409 flow. Second operand 7 states and 296 transitions. [2025-01-10 01:04:42,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 120 transitions, 841 flow [2025-01-10 01:04:42,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 120 transitions, 802 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-01-10 01:04:42,894 INFO L231 Difference]: Finished difference. Result has 86 places, 76 transitions, 449 flow [2025-01-10 01:04:42,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=449, PETRI_PLACES=86, PETRI_TRANSITIONS=76} [2025-01-10 01:04:42,895 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 24 predicate places. [2025-01-10 01:04:42,895 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 76 transitions, 449 flow [2025-01-10 01:04:42,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.27272727272727) internal successors, (355), 11 states have internal predecessors, (355), 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-01-10 01:04:42,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:42,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:42,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:04:43,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 01:04:43,099 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:04:43,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:43,099 INFO L85 PathProgramCache]: Analyzing trace with hash 261013933, now seen corresponding path program 1 times [2025-01-10 01:04:43,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:43,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600243705] [2025-01-10 01:04:43,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:43,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:43,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:04:43,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:04:43,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:43,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:04:43,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:43,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600243705] [2025-01-10 01:04:43,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600243705] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:04:43,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048234274] [2025-01-10 01:04:43,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:43,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:04:43,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:04:43,225 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:04:43,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:04:43,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:04:43,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:04:43,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:43,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:43,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:04:43,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:04:43,292 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-01-10 01:04:43,325 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:04:43,326 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-01-10 01:04:43,330 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-01-10 01:04:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:04:43,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:04:43,465 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 52 treesize of output 48 [2025-01-10 01:04:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:04:43,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048234274] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:04:43,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:04:43,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2025-01-10 01:04:43,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854656885] [2025-01-10 01:04:43,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:04:43,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:04:43,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:43,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:04:43,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:04:47,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:04:51,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:04:55,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:04:59,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:05:03,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:05:07,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:05:11,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:05:15,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:05:19,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:05:19,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-01-10 01:05:19,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 76 transitions, 449 flow. Second operand has 11 states, 11 states have (on average 24.363636363636363) internal successors, (268), 11 states have internal predecessors, (268), 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-01-10 01:05:19,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:19,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-01-10 01:05:19,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:20,366 INFO L124 PetriNetUnfolderBase]: 850/1623 cut-off events. [2025-01-10 01:05:20,366 INFO L125 PetriNetUnfolderBase]: For 4561/4777 co-relation queries the response was YES. [2025-01-10 01:05:20,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4831 conditions, 1623 events. 850/1623 cut-off events. For 4561/4777 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 8388 event pairs, 356 based on Foata normal form. 16/1596 useless extension candidates. Maximal degree in co-relation 3188. Up to 595 conditions per place. [2025-01-10 01:05:20,373 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 89 selfloop transitions, 17 changer transitions 0/122 dead transitions. [2025-01-10 01:05:20,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 122 transitions, 869 flow [2025-01-10 01:05:20,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:05:20,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:05:20,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 288 transitions. [2025-01-10 01:05:20,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-01-10 01:05:20,375 INFO L175 Difference]: Start difference. First operand has 86 places, 76 transitions, 449 flow. Second operand 9 states and 288 transitions. [2025-01-10 01:05:20,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 122 transitions, 869 flow [2025-01-10 01:05:20,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 122 transitions, 839 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-10 01:05:20,379 INFO L231 Difference]: Finished difference. Result has 91 places, 76 transitions, 472 flow [2025-01-10 01:05:20,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=472, PETRI_PLACES=91, PETRI_TRANSITIONS=76} [2025-01-10 01:05:20,380 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 29 predicate places. [2025-01-10 01:05:20,380 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 76 transitions, 472 flow [2025-01-10 01:05:20,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 24.363636363636363) internal successors, (268), 11 states have internal predecessors, (268), 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-01-10 01:05:20,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:20,380 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:20,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:05:20,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 01:05:20,585 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:05:20,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:20,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1263975205, now seen corresponding path program 1 times [2025-01-10 01:05:20,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:20,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575113294] [2025-01-10 01:05:20,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:20,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:20,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:05:20,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:05:20,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:20,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:20,658 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:05:20,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:20,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575113294] [2025-01-10 01:05:20,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575113294] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:20,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808441759] [2025-01-10 01:05:20,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:20,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:20,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:20,661 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:05:20,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:05:20,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:05:20,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:05:20,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:20,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:20,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:05:20,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:20,829 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:05:20,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:05:20,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808441759] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:20,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:20,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-01-10 01:05:20,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620485092] [2025-01-10 01:05:20,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:20,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:05:20,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:20,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:05:20,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:05:21,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2025-01-10 01:05:21,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 76 transitions, 472 flow. Second operand has 16 states, 16 states have (on average 35.125) internal successors, (562), 16 states have internal predecessors, (562), 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-01-10 01:05:21,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:21,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2025-01-10 01:05:21,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:21,783 INFO L124 PetriNetUnfolderBase]: 2102/4297 cut-off events. [2025-01-10 01:05:21,784 INFO L125 PetriNetUnfolderBase]: For 12575/12806 co-relation queries the response was YES. [2025-01-10 01:05:21,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13155 conditions, 4297 events. 2102/4297 cut-off events. For 12575/12806 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 29645 event pairs, 879 based on Foata normal form. 78/4321 useless extension candidates. Maximal degree in co-relation 6673. Up to 792 conditions per place. [2025-01-10 01:05:21,814 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 215 selfloop transitions, 46 changer transitions 0/279 dead transitions. [2025-01-10 01:05:21,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 279 transitions, 2218 flow [2025-01-10 01:05:21,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 01:05:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-10 01:05:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 891 transitions. [2025-01-10 01:05:21,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-01-10 01:05:21,817 INFO L175 Difference]: Start difference. First operand has 91 places, 76 transitions, 472 flow. Second operand 21 states and 891 transitions. [2025-01-10 01:05:21,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 279 transitions, 2218 flow [2025-01-10 01:05:21,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 279 transitions, 2130 flow, removed 14 selfloop flow, removed 7 redundant places. [2025-01-10 01:05:21,831 INFO L231 Difference]: Finished difference. Result has 110 places, 107 transitions, 859 flow [2025-01-10 01:05:21,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=859, PETRI_PLACES=110, PETRI_TRANSITIONS=107} [2025-01-10 01:05:21,831 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 48 predicate places. [2025-01-10 01:05:21,831 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 107 transitions, 859 flow [2025-01-10 01:05:21,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 35.125) internal successors, (562), 16 states have internal predecessors, (562), 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-01-10 01:05:21,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:21,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:21,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:05:22,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:22,036 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:05:22,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:22,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1142391567, now seen corresponding path program 1 times [2025-01-10 01:05:22,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:22,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076436320] [2025-01-10 01:05:22,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:22,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:22,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:05:22,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:05:22,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:22,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:22,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:22,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:22,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076436320] [2025-01-10 01:05:22,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076436320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:22,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:22,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:05:22,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272574803] [2025-01-10 01:05:22,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:22,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:05:22,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:22,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:05:22,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:05:22,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-01-10 01:05:22,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 107 transitions, 859 flow. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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-01-10 01:05:22,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:22,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-01-10 01:05:22,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:22,478 INFO L124 PetriNetUnfolderBase]: 2352/4908 cut-off events. [2025-01-10 01:05:22,478 INFO L125 PetriNetUnfolderBase]: For 17648/18202 co-relation queries the response was YES. [2025-01-10 01:05:22,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15364 conditions, 4908 events. 2352/4908 cut-off events. For 17648/18202 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 36948 event pairs, 1182 based on Foata normal form. 72/4837 useless extension candidates. Maximal degree in co-relation 10604. Up to 2858 conditions per place. [2025-01-10 01:05:22,505 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 103 selfloop transitions, 1 changer transitions 9/132 dead transitions. [2025-01-10 01:05:22,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 132 transitions, 1200 flow [2025-01-10 01:05:22,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:05:22,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:05:22,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2025-01-10 01:05:22,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-01-10 01:05:22,507 INFO L175 Difference]: Start difference. First operand has 110 places, 107 transitions, 859 flow. Second operand 4 states and 187 transitions. [2025-01-10 01:05:22,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 132 transitions, 1200 flow [2025-01-10 01:05:22,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 132 transitions, 1170 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-01-10 01:05:22,555 INFO L231 Difference]: Finished difference. Result has 113 places, 107 transitions, 844 flow [2025-01-10 01:05:22,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=844, PETRI_PLACES=113, PETRI_TRANSITIONS=107} [2025-01-10 01:05:22,556 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 51 predicate places. [2025-01-10 01:05:22,556 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 107 transitions, 844 flow [2025-01-10 01:05:22,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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-01-10 01:05:22,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:22,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:22,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:05:22,557 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:05:22,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:22,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1711405111, now seen corresponding path program 2 times [2025-01-10 01:05:22,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:22,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332314419] [2025-01-10 01:05:22,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:22,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:22,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-10 01:05:22,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 17 statements. [2025-01-10 01:05:22,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:05:22,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:22,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:22,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:22,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332314419] [2025-01-10 01:05:22,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332314419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:22,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:22,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:05:22,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465632679] [2025-01-10 01:05:22,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:22,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:05:22,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:22,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:05:22,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:05:22,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-01-10 01:05:22,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 107 transitions, 844 flow. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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-01-10 01:05:22,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:22,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-01-10 01:05:22,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:23,029 INFO L124 PetriNetUnfolderBase]: 2564/5377 cut-off events. [2025-01-10 01:05:23,030 INFO L125 PetriNetUnfolderBase]: For 20371/21005 co-relation queries the response was YES. [2025-01-10 01:05:23,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17063 conditions, 5377 events. 2564/5377 cut-off events. For 20371/21005 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 42115 event pairs, 1583 based on Foata normal form. 63/5209 useless extension candidates. Maximal degree in co-relation 16932. Up to 3605 conditions per place. [2025-01-10 01:05:23,061 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 114 selfloop transitions, 1 changer transitions 7/141 dead transitions. [2025-01-10 01:05:23,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 141 transitions, 1343 flow [2025-01-10 01:05:23,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:05:23,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:05:23,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 185 transitions. [2025-01-10 01:05:23,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7007575757575758 [2025-01-10 01:05:23,062 INFO L175 Difference]: Start difference. First operand has 113 places, 107 transitions, 844 flow. Second operand 4 states and 185 transitions. [2025-01-10 01:05:23,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 141 transitions, 1343 flow [2025-01-10 01:05:23,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 141 transitions, 1337 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 01:05:23,082 INFO L231 Difference]: Finished difference. Result has 115 places, 107 transitions, 866 flow [2025-01-10 01:05:23,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=866, PETRI_PLACES=115, PETRI_TRANSITIONS=107} [2025-01-10 01:05:23,082 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 53 predicate places. [2025-01-10 01:05:23,083 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 107 transitions, 866 flow [2025-01-10 01:05:23,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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-01-10 01:05:23,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:23,083 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:23,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:05:23,083 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:05:23,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:23,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1975810132, now seen corresponding path program 1 times [2025-01-10 01:05:23,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:23,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968708727] [2025-01-10 01:05:23,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:23,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:23,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:05:23,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:05:23,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:23,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:05:23,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:23,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968708727] [2025-01-10 01:05:23,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968708727] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:23,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524501485] [2025-01-10 01:05:23,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:23,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:23,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:23,162 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:05:23,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:05:23,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:05:23,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:05:23,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:23,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:23,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:05:23,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:23,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:05:23,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:23,360 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:05:23,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524501485] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:23,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:23,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-01-10 01:05:23,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401962233] [2025-01-10 01:05:23,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:23,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:05:23,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:23,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:05:23,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:05:23,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2025-01-10 01:05:23,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 107 transitions, 866 flow. Second operand has 16 states, 16 states have (on average 35.375) internal successors, (566), 16 states have internal predecessors, (566), 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-01-10 01:05:23,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:23,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2025-01-10 01:05:23,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:24,323 INFO L124 PetriNetUnfolderBase]: 2353/4789 cut-off events. [2025-01-10 01:05:24,323 INFO L125 PetriNetUnfolderBase]: For 22173/22840 co-relation queries the response was YES. [2025-01-10 01:05:24,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15986 conditions, 4789 events. 2353/4789 cut-off events. For 22173/22840 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 35628 event pairs, 1429 based on Foata normal form. 89/4782 useless extension candidates. Maximal degree in co-relation 15854. Up to 1034 conditions per place. [2025-01-10 01:05:24,347 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 191 selfloop transitions, 46 changer transitions 0/255 dead transitions. [2025-01-10 01:05:24,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 255 transitions, 2236 flow [2025-01-10 01:05:24,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 01:05:24,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-10 01:05:24,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 885 transitions. [2025-01-10 01:05:24,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6385281385281385 [2025-01-10 01:05:24,351 INFO L175 Difference]: Start difference. First operand has 115 places, 107 transitions, 866 flow. Second operand 21 states and 885 transitions. [2025-01-10 01:05:24,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 255 transitions, 2236 flow [2025-01-10 01:05:24,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 255 transitions, 2224 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-01-10 01:05:24,368 INFO L231 Difference]: Finished difference. Result has 135 places, 123 transitions, 1151 flow [2025-01-10 01:05:24,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1151, PETRI_PLACES=135, PETRI_TRANSITIONS=123} [2025-01-10 01:05:24,369 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 73 predicate places. [2025-01-10 01:05:24,369 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 123 transitions, 1151 flow [2025-01-10 01:05:24,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 35.375) internal successors, (566), 16 states have internal predecessors, (566), 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-01-10 01:05:24,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:24,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:24,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 01:05:24,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:24,571 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:05:24,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:24,572 INFO L85 PathProgramCache]: Analyzing trace with hash -831824157, now seen corresponding path program 1 times [2025-01-10 01:05:24,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:24,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740896952] [2025-01-10 01:05:24,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:24,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:24,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:05:24,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:05:24,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:24,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:24,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:24,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740896952] [2025-01-10 01:05:24,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740896952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:24,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:24,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:05:24,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533195225] [2025-01-10 01:05:24,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:24,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:05:24,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:24,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:05:24,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:05:24,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-01-10 01:05:24,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 123 transitions, 1151 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 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-01-10 01:05:24,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:24,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-01-10 01:05:24,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:24,844 INFO L124 PetriNetUnfolderBase]: 1611/3552 cut-off events. [2025-01-10 01:05:24,844 INFO L125 PetriNetUnfolderBase]: For 19572/20028 co-relation queries the response was YES. [2025-01-10 01:05:24,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12448 conditions, 3552 events. 1611/3552 cut-off events. For 19572/20028 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 25902 event pairs, 589 based on Foata normal form. 167/3657 useless extension candidates. Maximal degree in co-relation 8463. Up to 2188 conditions per place. [2025-01-10 01:05:24,862 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 107 selfloop transitions, 18 changer transitions 5/149 dead transitions. [2025-01-10 01:05:24,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 149 transitions, 1669 flow [2025-01-10 01:05:24,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:05:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:05:24,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2025-01-10 01:05:24,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2025-01-10 01:05:24,864 INFO L175 Difference]: Start difference. First operand has 135 places, 123 transitions, 1151 flow. Second operand 3 states and 144 transitions. [2025-01-10 01:05:24,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 149 transitions, 1669 flow [2025-01-10 01:05:24,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 149 transitions, 1618 flow, removed 9 selfloop flow, removed 10 redundant places. [2025-01-10 01:05:24,878 INFO L231 Difference]: Finished difference. Result has 128 places, 139 transitions, 1418 flow [2025-01-10 01:05:24,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1100, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1418, PETRI_PLACES=128, PETRI_TRANSITIONS=139} [2025-01-10 01:05:24,879 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 66 predicate places. [2025-01-10 01:05:24,880 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 139 transitions, 1418 flow [2025-01-10 01:05:24,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 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-01-10 01:05:24,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:24,880 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:24,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 01:05:24,880 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:05:24,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:24,881 INFO L85 PathProgramCache]: Analyzing trace with hash 398995814, now seen corresponding path program 2 times [2025-01-10 01:05:24,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:24,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427210732] [2025-01-10 01:05:24,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:24,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:24,888 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-10 01:05:24,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:05:24,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:05:24,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:25,069 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:05:25,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:25,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427210732] [2025-01-10 01:05:25,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427210732] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:25,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779202824] [2025-01-10 01:05:25,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:25,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:25,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:25,075 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:05:25,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:05:25,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-10 01:05:25,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:05:25,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:05:25,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:25,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 01:05:25,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:25,140 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-01-10 01:05:25,206 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:05:25,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-10 01:05:25,215 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:05:25,215 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-01-10 01:05:25,315 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:05:25,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:25,455 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 52 treesize of output 48 [2025-01-10 01:05:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:05:25,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779202824] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:25,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:25,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 20 [2025-01-10 01:05:25,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765595393] [2025-01-10 01:05:25,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:25,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 01:05:25,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:25,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 01:05:25,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:05:29,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:05:33,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:05:38,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]