./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf26be9bd61f36f1b6136fc4e500a91a95d08528025fd00027577283116c4a35 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:09:27,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:09:27,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:09:27,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:09:27,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:09:27,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:09:27,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:09:27,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:09:27,479 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:09:27,480 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:09:27,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:09:27,480 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:09:27,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:09:27,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:09:27,481 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:09:27,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:09:27,481 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:09:27,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:09:27,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:09:27,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:09:27,481 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:09:27,481 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:09:27,481 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:09:27,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:09:27,482 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:09:27,482 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:09:27,482 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:09:27,482 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:09:27,482 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:09:27,482 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:09:27,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:09:27,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:09:27,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:09:27,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:09:27,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:09:27,482 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:09:27,482 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:09:27,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:09:27,482 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:09:27,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:09:27,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:09:27,483 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:09:27,483 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf26be9bd61f36f1b6136fc4e500a91a95d08528025fd00027577283116c4a35 [2025-03-04 10:09:27,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:09:27,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:09:27,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:09:27,755 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:09:27,755 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:09:27,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c [2025-03-04 10:09:28,946 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4bd8dddc/eb0670570e794e138f62f8358c003b5c/FLAGfa97f127f [2025-03-04 10:09:29,169 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:09:29,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c [2025-03-04 10:09:29,176 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4bd8dddc/eb0670570e794e138f62f8358c003b5c/FLAGfa97f127f [2025-03-04 10:09:29,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4bd8dddc/eb0670570e794e138f62f8358c003b5c [2025-03-04 10:09:29,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:09:29,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:09:29,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:09:29,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:09:29,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:09:29,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:09:29" (1/1) ... [2025-03-04 10:09:29,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1574222b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:29, skipping insertion in model container [2025-03-04 10:09:29,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:09:29" (1/1) ... [2025-03-04 10:09:29,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:09:29,325 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:09:29,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:09:29,334 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:09:29,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:09:29,367 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:09:29,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:29 WrapperNode [2025-03-04 10:09:29,368 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:09:29,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:09:29,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:09:29,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:09:29,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:29" (1/1) ... [2025-03-04 10:09:29,377 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:29" (1/1) ... [2025-03-04 10:09:29,391 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 119 [2025-03-04 10:09:29,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:09:29,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:09:29,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:09:29,392 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:09:29,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:29" (1/1) ... [2025-03-04 10:09:29,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:29" (1/1) ... [2025-03-04 10:09:29,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:29" (1/1) ... [2025-03-04 10:09:29,409 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 10:09:29,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:29" (1/1) ... [2025-03-04 10:09:29,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:29" (1/1) ... [2025-03-04 10:09:29,413 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:29" (1/1) ... [2025-03-04 10:09:29,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:29" (1/1) ... [2025-03-04 10:09:29,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:29" (1/1) ... [2025-03-04 10:09:29,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:29" (1/1) ... [2025-03-04 10:09:29,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:09:29,421 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:09:29,421 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:09:29,421 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:09:29,422 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:29" (1/1) ... [2025-03-04 10:09:29,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:09:29,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:29,446 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:09:29,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:09:29,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:09:29,462 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:09:29,463 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:09:29,463 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:09:29,463 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:09:29,463 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:09:29,463 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:09:29,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:09:29,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:09:29,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:09:29,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:09:29,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:09:29,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:09:29,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:09:29,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:09:29,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:09:29,464 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:09:29,537 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:09:29,539 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:09:29,806 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:09:29,806 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:09:29,913 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:09:29,913 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:09:29,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:09:29 BoogieIcfgContainer [2025-03-04 10:09:29,913 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:09:29,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:09:29,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:09:29,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:09:29,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:09:29" (1/3) ... [2025-03-04 10:09:29,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d9b810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:09:29, skipping insertion in model container [2025-03-04 10:09:29,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:29" (2/3) ... [2025-03-04 10:09:29,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d9b810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:09:29, skipping insertion in model container [2025-03-04 10:09:29,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:09:29" (3/3) ... [2025-03-04 10:09:29,923 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2025-03-04 10:09:29,937 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:09:29,938 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-min-max-1.wvr.c that has 4 procedures, 79 locations, 1 initial locations, 3 loop locations, and 18 error locations. [2025-03-04 10:09:29,939 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:09:30,008 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 10:09:30,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 84 transitions, 189 flow [2025-03-04 10:09:30,065 INFO L124 PetriNetUnfolderBase]: 6/81 cut-off events. [2025-03-04 10:09:30,068 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:09:30,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 81 events. 6/81 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 163 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2025-03-04 10:09:30,070 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 84 transitions, 189 flow [2025-03-04 10:09:30,072 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 80 transitions, 178 flow [2025-03-04 10:09:30,078 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:09:30,088 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;@71f2085a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:09:30,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-03-04 10:09:30,095 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:09:30,095 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2025-03-04 10:09:30,095 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:09:30,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:30,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:30,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:09:30,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:30,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1240833966, now seen corresponding path program 1 times [2025-03-04 10:09:30,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:30,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883864424] [2025-03-04 10:09:30,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:30,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:30,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:09:30,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:30,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:30,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:30,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:30,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:30,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883864424] [2025-03-04 10:09:30,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883864424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:30,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:30,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:09:30,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231123716] [2025-03-04 10:09:30,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:30,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:09:30,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:30,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:09:30,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:09:30,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 84 [2025-03-04 10:09:30,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 80 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:30,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:30,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 84 [2025-03-04 10:09:30,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:30,697 INFO L124 PetriNetUnfolderBase]: 1210/2180 cut-off events. [2025-03-04 10:09:30,698 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-03-04 10:09:30,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3975 conditions, 2180 events. 1210/2180 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13683 event pairs, 755 based on Foata normal form. 1/1611 useless extension candidates. Maximal degree in co-relation 3755. Up to 1649 conditions per place. [2025-03-04 10:09:30,719 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 42 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2025-03-04 10:09:30,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 77 transitions, 260 flow [2025-03-04 10:09:30,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:09:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:09:30,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2025-03-04 10:09:30,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.623015873015873 [2025-03-04 10:09:30,732 INFO L175 Difference]: Start difference. First operand has 84 places, 80 transitions, 178 flow. Second operand 3 states and 157 transitions. [2025-03-04 10:09:30,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 77 transitions, 260 flow [2025-03-04 10:09:30,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 77 transitions, 248 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:09:30,743 INFO L231 Difference]: Finished difference. Result has 77 places, 77 transitions, 164 flow [2025-03-04 10:09:30,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=77, PETRI_TRANSITIONS=77} [2025-03-04 10:09:30,750 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -7 predicate places. [2025-03-04 10:09:30,750 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 77 transitions, 164 flow [2025-03-04 10:09:30,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:30,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:30,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:30,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:09:30,751 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:09:30,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:30,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1240833967, now seen corresponding path program 1 times [2025-03-04 10:09:30,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:30,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256298778] [2025-03-04 10:09:30,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:30,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:30,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:09:30,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:30,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:30,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:31,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:31,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256298778] [2025-03-04 10:09:31,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256298778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:31,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:31,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:09:31,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951685394] [2025-03-04 10:09:31,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:31,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:09:31,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:31,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:09:31,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:09:31,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 84 [2025-03-04 10:09:31,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 77 transitions, 164 flow. Second operand has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:31,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:31,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 84 [2025-03-04 10:09:31,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:31,481 INFO L124 PetriNetUnfolderBase]: 1210/2182 cut-off events. [2025-03-04 10:09:31,482 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-04 10:09:31,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3898 conditions, 2182 events. 1210/2182 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13693 event pairs, 755 based on Foata normal form. 1/1613 useless extension candidates. Maximal degree in co-relation 3855. Up to 1646 conditions per place. [2025-03-04 10:09:31,493 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 42 selfloop transitions, 5 changer transitions 0/79 dead transitions. [2025-03-04 10:09:31,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 79 transitions, 262 flow [2025-03-04 10:09:31,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:09:31,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:09:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 271 transitions. [2025-03-04 10:09:31,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5376984126984127 [2025-03-04 10:09:31,495 INFO L175 Difference]: Start difference. First operand has 77 places, 77 transitions, 164 flow. Second operand 6 states and 271 transitions. [2025-03-04 10:09:31,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 79 transitions, 262 flow [2025-03-04 10:09:31,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 79 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:31,502 INFO L231 Difference]: Finished difference. Result has 81 places, 78 transitions, 180 flow [2025-03-04 10:09:31,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=81, PETRI_TRANSITIONS=78} [2025-03-04 10:09:31,502 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -3 predicate places. [2025-03-04 10:09:31,502 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 78 transitions, 180 flow [2025-03-04 10:09:31,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:31,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:31,503 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:31,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:09:31,503 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:09:31,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:31,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1559452692, now seen corresponding path program 1 times [2025-03-04 10:09:31,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:31,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268577513] [2025-03-04 10:09:31,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:31,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:31,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:09:31,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:09:31,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:31,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:31,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:31,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:31,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268577513] [2025-03-04 10:09:31,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268577513] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:31,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530060026] [2025-03-04 10:09:31,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:31,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:31,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:31,750 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:31,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:09:31,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:09:31,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:09:31,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:31,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:31,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:09:31,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:31,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:09:31,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:31,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:32,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:32,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530060026] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:32,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:32,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 10:09:32,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217523571] [2025-03-04 10:09:32,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:32,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:09:32,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:32,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:09:32,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:09:32,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 84 [2025-03-04 10:09:32,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 78 transitions, 180 flow. Second operand has 15 states, 15 states have (on average 39.333333333333336) internal successors, (590), 15 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:32,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:32,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 84 [2025-03-04 10:09:32,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:33,055 INFO L124 PetriNetUnfolderBase]: 1210/2181 cut-off events. [2025-03-04 10:09:33,055 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 10:09:33,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3903 conditions, 2181 events. 1210/2181 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13686 event pairs, 755 based on Foata normal form. 0/1612 useless extension candidates. Maximal degree in co-relation 3863. Up to 1646 conditions per place. [2025-03-04 10:09:33,065 INFO L140 encePairwiseOnDemand]: 76/84 looper letters, 37 selfloop transitions, 9 changer transitions 0/78 dead transitions. [2025-03-04 10:09:33,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 78 transitions, 270 flow [2025-03-04 10:09:33,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:09:33,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:09:33,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 343 transitions. [2025-03-04 10:09:33,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2025-03-04 10:09:33,067 INFO L175 Difference]: Start difference. First operand has 81 places, 78 transitions, 180 flow. Second operand 8 states and 343 transitions. [2025-03-04 10:09:33,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 78 transitions, 270 flow [2025-03-04 10:09:33,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 78 transitions, 262 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:09:33,069 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 188 flow [2025-03-04 10:09:33,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=188, PETRI_PLACES=83, PETRI_TRANSITIONS=78} [2025-03-04 10:09:33,070 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -1 predicate places. [2025-03-04 10:09:33,070 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 188 flow [2025-03-04 10:09:33,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 39.333333333333336) internal successors, (590), 15 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:33,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:33,070 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:33,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:09:33,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:33,275 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:09:33,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:33,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1098392180, now seen corresponding path program 1 times [2025-03-04 10:09:33,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:33,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542229193] [2025-03-04 10:09:33,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:33,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:33,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:09:33,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:09:33,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:33,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:33,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:33,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:33,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542229193] [2025-03-04 10:09:33,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542229193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:33,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:33,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:09:33,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741519331] [2025-03-04 10:09:33,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:33,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:09:33,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:33,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:09:33,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:09:33,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 84 [2025-03-04 10:09:33,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:33,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:33,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 84 [2025-03-04 10:09:33,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:33,607 INFO L124 PetriNetUnfolderBase]: 2007/3320 cut-off events. [2025-03-04 10:09:33,607 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 10:09:33,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6293 conditions, 3320 events. 2007/3320 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 19051 event pairs, 1538 based on Foata normal form. 0/3058 useless extension candidates. Maximal degree in co-relation 6240. Up to 2835 conditions per place. [2025-03-04 10:09:33,618 INFO L140 encePairwiseOnDemand]: 75/84 looper letters, 50 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2025-03-04 10:09:33,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 71 transitions, 278 flow [2025-03-04 10:09:33,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:09:33,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:09:33,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2025-03-04 10:09:33,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2025-03-04 10:09:33,619 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 188 flow. Second operand 4 states and 153 transitions. [2025-03-04 10:09:33,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 71 transitions, 278 flow [2025-03-04 10:09:33,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 71 transitions, 252 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-03-04 10:09:33,621 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 152 flow [2025-03-04 10:09:33,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2025-03-04 10:09:33,621 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -12 predicate places. [2025-03-04 10:09:33,622 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 152 flow [2025-03-04 10:09:33,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:33,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:33,622 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:33,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:09:33,622 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:09:33,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:33,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1098392179, now seen corresponding path program 1 times [2025-03-04 10:09:33,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:33,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057101998] [2025-03-04 10:09:33,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:33,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:33,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:09:33,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:09:33,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:33,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:33,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:33,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057101998] [2025-03-04 10:09:33,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057101998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:33,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661786286] [2025-03-04 10:09:33,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:33,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:33,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:33,713 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:33,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:09:33,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:09:33,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:09:33,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:33,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:33,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:09:33,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:33,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:09:33,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:33,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:33,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:09:33,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661786286] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:33,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:09:33,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-04 10:09:33,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549252414] [2025-03-04 10:09:33,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:33,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:09:33,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:33,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:09:33,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:09:33,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 84 [2025-03-04 10:09:33,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:33,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:33,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 84 [2025-03-04 10:09:33,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:34,122 INFO L124 PetriNetUnfolderBase]: 1404/2461 cut-off events. [2025-03-04 10:09:34,123 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 10:09:34,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4478 conditions, 2461 events. 1404/2461 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14664 event pairs, 938 based on Foata normal form. 0/1926 useless extension candidates. Maximal degree in co-relation 4437. Up to 1930 conditions per place. [2025-03-04 10:09:34,132 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 45 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2025-03-04 10:09:34,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 68 transitions, 242 flow [2025-03-04 10:09:34,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:09:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:09:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 216 transitions. [2025-03-04 10:09:34,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2025-03-04 10:09:34,136 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 152 flow. Second operand 5 states and 216 transitions. [2025-03-04 10:09:34,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 68 transitions, 242 flow [2025-03-04 10:09:34,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 68 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:34,138 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 149 flow [2025-03-04 10:09:34,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2025-03-04 10:09:34,138 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -13 predicate places. [2025-03-04 10:09:34,139 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 149 flow [2025-03-04 10:09:34,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:34,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:34,139 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:34,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:09:34,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:34,340 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:09:34,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:34,341 INFO L85 PathProgramCache]: Analyzing trace with hash -334055334, now seen corresponding path program 1 times [2025-03-04 10:09:34,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:34,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271541716] [2025-03-04 10:09:34,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:34,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:34,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:09:34,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:09:34,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:34,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:34,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:09:34,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:34,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271541716] [2025-03-04 10:09:34,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271541716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:34,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:34,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:09:34,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286191650] [2025-03-04 10:09:34,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:34,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:09:34,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:34,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:09:34,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:09:34,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 84 [2025-03-04 10:09:34,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 149 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:34,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:34,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 84 [2025-03-04 10:09:34,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:34,502 INFO L124 PetriNetUnfolderBase]: 1209/2052 cut-off events. [2025-03-04 10:09:34,503 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-04 10:09:34,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3771 conditions, 2052 events. 1209/2052 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12086 event pairs, 755 based on Foata normal form. 1/1612 useless extension candidates. Maximal degree in co-relation 3728. Up to 1655 conditions per place. [2025-03-04 10:09:34,511 INFO L140 encePairwiseOnDemand]: 82/84 looper letters, 47 selfloop transitions, 0 changer transitions 1/68 dead transitions. [2025-03-04 10:09:34,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 68 transitions, 245 flow [2025-03-04 10:09:34,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:09:34,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:09:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-03-04 10:09:34,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6150793650793651 [2025-03-04 10:09:34,512 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 149 flow. Second operand 3 states and 155 transitions. [2025-03-04 10:09:34,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 68 transitions, 245 flow [2025-03-04 10:09:34,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 68 transitions, 240 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:09:34,528 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 144 flow [2025-03-04 10:09:34,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2025-03-04 10:09:34,528 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -13 predicate places. [2025-03-04 10:09:34,528 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 144 flow [2025-03-04 10:09:34,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:34,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:34,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:34,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:09:34,529 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:09:34,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:34,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1401300888, now seen corresponding path program 1 times [2025-03-04 10:09:34,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:34,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263819050] [2025-03-04 10:09:34,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:34,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:34,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:09:34,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:09:34,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:34,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:34,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:09:34,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:34,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263819050] [2025-03-04 10:09:34,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263819050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:34,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:34,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:09:34,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113672811] [2025-03-04 10:09:34,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:34,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:09:34,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:34,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:09:34,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:09:34,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 84 [2025-03-04 10:09:34,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 144 flow. Second operand has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:34,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:34,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 84 [2025-03-04 10:09:34,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:35,057 INFO L124 PetriNetUnfolderBase]: 3446/5275 cut-off events. [2025-03-04 10:09:35,058 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-04 10:09:35,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10344 conditions, 5275 events. 3446/5275 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 29276 event pairs, 1908 based on Foata normal form. 0/4749 useless extension candidates. Maximal degree in co-relation 10340. Up to 3432 conditions per place. [2025-03-04 10:09:35,079 INFO L140 encePairwiseOnDemand]: 75/84 looper letters, 72 selfloop transitions, 7 changer transitions 0/91 dead transitions. [2025-03-04 10:09:35,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 91 transitions, 352 flow [2025-03-04 10:09:35,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:09:35,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:09:35,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 235 transitions. [2025-03-04 10:09:35,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4662698412698413 [2025-03-04 10:09:35,081 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 144 flow. Second operand 6 states and 235 transitions. [2025-03-04 10:09:35,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 91 transitions, 352 flow [2025-03-04 10:09:35,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 91 transitions, 350 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 10:09:35,083 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 171 flow [2025-03-04 10:09:35,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=171, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2025-03-04 10:09:35,083 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -9 predicate places. [2025-03-04 10:09:35,083 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 171 flow [2025-03-04 10:09:35,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:35,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:35,083 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:35,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:09:35,083 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:09:35,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:35,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1271703725, now seen corresponding path program 1 times [2025-03-04 10:09:35,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:35,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180060895] [2025-03-04 10:09:35,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:35,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:35,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:09:35,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:09:35,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:35,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:35,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:35,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:35,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180060895] [2025-03-04 10:09:35,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180060895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:35,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482643965] [2025-03-04 10:09:35,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:35,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:35,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:35,225 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:35,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:09:35,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:09:35,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:09:35,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:35,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:35,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:09:35,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:09:35,338 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:09:35,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482643965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:35,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:09:35,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-04 10:09:35,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15449690] [2025-03-04 10:09:35,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:35,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:09:35,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:35,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:09:35,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:09:35,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 84 [2025-03-04 10:09:35,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:35,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:35,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 84 [2025-03-04 10:09:35,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:35,647 INFO L124 PetriNetUnfolderBase]: 2866/4843 cut-off events. [2025-03-04 10:09:35,647 INFO L125 PetriNetUnfolderBase]: For 301/416 co-relation queries the response was YES. [2025-03-04 10:09:35,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9772 conditions, 4843 events. 2866/4843 cut-off events. For 301/416 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 30805 event pairs, 1608 based on Foata normal form. 265/4649 useless extension candidates. Maximal degree in co-relation 9767. Up to 3042 conditions per place. [2025-03-04 10:09:35,667 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 70 selfloop transitions, 4 changer transitions 0/90 dead transitions. [2025-03-04 10:09:35,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 90 transitions, 373 flow [2025-03-04 10:09:35,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:09:35,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:09:35,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2025-03-04 10:09:35,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5654761904761905 [2025-03-04 10:09:35,669 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 171 flow. Second operand 4 states and 190 transitions. [2025-03-04 10:09:35,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 90 transitions, 373 flow [2025-03-04 10:09:35,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 90 transitions, 360 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:09:35,673 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 183 flow [2025-03-04 10:09:35,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2025-03-04 10:09:35,674 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -9 predicate places. [2025-03-04 10:09:35,674 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 183 flow [2025-03-04 10:09:35,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:35,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:35,674 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:35,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:35,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:35,875 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:09:35,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:35,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1304209746, now seen corresponding path program 1 times [2025-03-04 10:09:35,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:35,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425387278] [2025-03-04 10:09:35,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:35,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:35,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:09:35,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:09:35,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:35,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:35,966 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:35,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:35,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425387278] [2025-03-04 10:09:35,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425387278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:35,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568761452] [2025-03-04 10:09:35,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:35,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:35,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:35,969 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:35,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:09:36,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:09:36,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:09:36,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:36,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:36,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:09:36,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:36,074 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:36,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:36,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568761452] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:36,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:36,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-04 10:09:36,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675682842] [2025-03-04 10:09:36,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:36,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:09:36,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:36,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:09:36,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:09:36,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 84 [2025-03-04 10:09:36,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 183 flow. Second operand has 14 states, 14 states have (on average 39.07142857142857) internal successors, (547), 14 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:36,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:36,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 84 [2025-03-04 10:09:36,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:36,744 INFO L124 PetriNetUnfolderBase]: 4170/6964 cut-off events. [2025-03-04 10:09:36,745 INFO L125 PetriNetUnfolderBase]: For 725/910 co-relation queries the response was YES. [2025-03-04 10:09:36,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15072 conditions, 6964 events. 4170/6964 cut-off events. For 725/910 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 47839 event pairs, 2294 based on Foata normal form. 235/6522 useless extension candidates. Maximal degree in co-relation 15066. Up to 3360 conditions per place. [2025-03-04 10:09:36,768 INFO L140 encePairwiseOnDemand]: 74/84 looper letters, 108 selfloop transitions, 12 changer transitions 0/139 dead transitions. [2025-03-04 10:09:36,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 139 transitions, 611 flow [2025-03-04 10:09:36,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:09:36,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:09:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 399 transitions. [2025-03-04 10:09:36,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-03-04 10:09:36,770 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 183 flow. Second operand 8 states and 399 transitions. [2025-03-04 10:09:36,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 139 transitions, 611 flow [2025-03-04 10:09:36,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 139 transitions, 598 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:36,772 INFO L231 Difference]: Finished difference. Result has 85 places, 78 transitions, 260 flow [2025-03-04 10:09:36,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=260, PETRI_PLACES=85, PETRI_TRANSITIONS=78} [2025-03-04 10:09:36,773 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 1 predicate places. [2025-03-04 10:09:36,773 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 78 transitions, 260 flow [2025-03-04 10:09:36,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 39.07142857142857) internal successors, (547), 14 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:36,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:36,773 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:36,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:36,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:36,974 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:09:36,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:36,974 INFO L85 PathProgramCache]: Analyzing trace with hash 839306521, now seen corresponding path program 1 times [2025-03-04 10:09:36,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:36,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391928254] [2025-03-04 10:09:36,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:36,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:36,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:09:36,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:09:36,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:36,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:37,074 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:37,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:37,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391928254] [2025-03-04 10:09:37,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391928254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:37,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574365005] [2025-03-04 10:09:37,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:37,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:37,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:37,078 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:37,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:09:37,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:09:37,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:09:37,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:37,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:37,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:09:37,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:37,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:37,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:37,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574365005] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:37,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:37,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-04 10:09:37,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605671552] [2025-03-04 10:09:37,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:37,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:09:37,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:37,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:09:37,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:09:37,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 84 [2025-03-04 10:09:37,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 78 transitions, 260 flow. Second operand has 14 states, 14 states have (on average 39.214285714285715) internal successors, (549), 14 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:37,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:37,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 84 [2025-03-04 10:09:37,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:37,868 INFO L124 PetriNetUnfolderBase]: 3703/6122 cut-off events. [2025-03-04 10:09:37,868 INFO L125 PetriNetUnfolderBase]: For 2398/2860 co-relation queries the response was YES. [2025-03-04 10:09:37,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13853 conditions, 6122 events. 3703/6122 cut-off events. For 2398/2860 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 40892 event pairs, 2164 based on Foata normal form. 299/5876 useless extension candidates. Maximal degree in co-relation 13843. Up to 3372 conditions per place. [2025-03-04 10:09:37,889 INFO L140 encePairwiseOnDemand]: 74/84 looper letters, 103 selfloop transitions, 12 changer transitions 0/135 dead transitions. [2025-03-04 10:09:37,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 135 transitions, 658 flow [2025-03-04 10:09:37,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:09:37,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:09:37,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 397 transitions. [2025-03-04 10:09:37,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5907738095238095 [2025-03-04 10:09:37,893 INFO L175 Difference]: Start difference. First operand has 85 places, 78 transitions, 260 flow. Second operand 8 states and 397 transitions. [2025-03-04 10:09:37,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 135 transitions, 658 flow [2025-03-04 10:09:37,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 135 transitions, 650 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 10:09:37,898 INFO L231 Difference]: Finished difference. Result has 94 places, 82 transitions, 317 flow [2025-03-04 10:09:37,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=317, PETRI_PLACES=94, PETRI_TRANSITIONS=82} [2025-03-04 10:09:37,899 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 10 predicate places. [2025-03-04 10:09:37,899 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 82 transitions, 317 flow [2025-03-04 10:09:37,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 39.214285714285715) internal successors, (549), 14 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:37,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:37,899 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:37,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:38,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 10:09:38,101 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:09:38,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:38,102 INFO L85 PathProgramCache]: Analyzing trace with hash -396905455, now seen corresponding path program 2 times [2025-03-04 10:09:38,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:38,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969092408] [2025-03-04 10:09:38,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:38,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:38,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 10:09:38,125 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:09:38,125 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:38,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:38,258 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:09:38,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:38,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969092408] [2025-03-04 10:09:38,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969092408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:38,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593200000] [2025-03-04 10:09:38,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:38,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:38,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:38,261 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:38,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:09:38,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 10:09:38,310 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:09:38,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:38,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:38,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:09:38,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:38,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2025-03-04 10:09:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:09:38,401 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:09:38,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593200000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:38,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:09:38,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-03-04 10:09:38,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38459071] [2025-03-04 10:09:38,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:38,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:09:38,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:38,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:09:38,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:09:38,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 84 [2025-03-04 10:09:38,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 82 transitions, 317 flow. Second operand has 8 states, 8 states have (on average 37.375) internal successors, (299), 8 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:38,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:38,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 84 [2025-03-04 10:09:38,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:39,114 INFO L124 PetriNetUnfolderBase]: 4444/7393 cut-off events. [2025-03-04 10:09:39,115 INFO L125 PetriNetUnfolderBase]: For 3371/3811 co-relation queries the response was YES. [2025-03-04 10:09:39,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17794 conditions, 7393 events. 4444/7393 cut-off events. For 3371/3811 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 49641 event pairs, 1325 based on Foata normal form. 228/7055 useless extension candidates. Maximal degree in co-relation 17780. Up to 2709 conditions per place. [2025-03-04 10:09:39,139 INFO L140 encePairwiseOnDemand]: 72/84 looper letters, 152 selfloop transitions, 14 changer transitions 0/184 dead transitions. [2025-03-04 10:09:39,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 184 transitions, 1026 flow [2025-03-04 10:09:39,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:09:39,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:09:39,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 433 transitions. [2025-03-04 10:09:39,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5727513227513228 [2025-03-04 10:09:39,141 INFO L175 Difference]: Start difference. First operand has 94 places, 82 transitions, 317 flow. Second operand 9 states and 433 transitions. [2025-03-04 10:09:39,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 184 transitions, 1026 flow [2025-03-04 10:09:39,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 184 transitions, 1001 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 10:09:39,153 INFO L231 Difference]: Finished difference. Result has 100 places, 85 transitions, 353 flow [2025-03-04 10:09:39,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=353, PETRI_PLACES=100, PETRI_TRANSITIONS=85} [2025-03-04 10:09:39,154 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 16 predicate places. [2025-03-04 10:09:39,155 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 85 transitions, 353 flow [2025-03-04 10:09:39,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 37.375) internal successors, (299), 8 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:39,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:39,155 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:39,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:39,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:39,356 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:09:39,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:39,356 INFO L85 PathProgramCache]: Analyzing trace with hash 794895374, now seen corresponding path program 1 times [2025-03-04 10:09:39,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:39,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857818939] [2025-03-04 10:09:39,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:39,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:39,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 10:09:39,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:09:39,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:39,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:39,486 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:39,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:39,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857818939] [2025-03-04 10:09:39,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857818939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:39,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984348338] [2025-03-04 10:09:39,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:39,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:39,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:39,489 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:39,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:09:39,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 10:09:39,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:09:39,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:39,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:39,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:09:39,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:39,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:09:39,661 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:39,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:39,808 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:39,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984348338] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:39,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:39,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-03-04 10:09:39,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244784096] [2025-03-04 10:09:39,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:39,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:09:39,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:39,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:09:39,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:09:40,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 84 [2025-03-04 10:09:40,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 85 transitions, 353 flow. Second operand has 22 states, 22 states have (on average 28.136363636363637) internal successors, (619), 22 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:40,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:40,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 84 [2025-03-04 10:09:40,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:41,322 INFO L124 PetriNetUnfolderBase]: 8503/12811 cut-off events. [2025-03-04 10:09:41,322 INFO L125 PetriNetUnfolderBase]: For 7671/8441 co-relation queries the response was YES. [2025-03-04 10:09:41,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33658 conditions, 12811 events. 8503/12811 cut-off events. For 7671/8441 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 76398 event pairs, 3210 based on Foata normal form. 632/12644 useless extension candidates. Maximal degree in co-relation 33642. Up to 3398 conditions per place. [2025-03-04 10:09:41,380 INFO L140 encePairwiseOnDemand]: 75/84 looper letters, 169 selfloop transitions, 14 changer transitions 0/196 dead transitions. [2025-03-04 10:09:41,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 196 transitions, 1040 flow [2025-03-04 10:09:41,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:09:41,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:09:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 425 transitions. [2025-03-04 10:09:41,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5059523809523809 [2025-03-04 10:09:41,382 INFO L175 Difference]: Start difference. First operand has 100 places, 85 transitions, 353 flow. Second operand 10 states and 425 transitions. [2025-03-04 10:09:41,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 196 transitions, 1040 flow [2025-03-04 10:09:41,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 196 transitions, 1016 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:09:41,402 INFO L231 Difference]: Finished difference. Result has 105 places, 88 transitions, 400 flow [2025-03-04 10:09:41,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=400, PETRI_PLACES=105, PETRI_TRANSITIONS=88} [2025-03-04 10:09:41,403 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 21 predicate places. [2025-03-04 10:09:41,403 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 88 transitions, 400 flow [2025-03-04 10:09:41,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 28.136363636363637) internal successors, (619), 22 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:41,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:41,404 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:41,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:09:41,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:41,605 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:09:41,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:41,606 INFO L85 PathProgramCache]: Analyzing trace with hash 880369084, now seen corresponding path program 2 times [2025-03-04 10:09:41,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:41,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252174528] [2025-03-04 10:09:41,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:41,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:41,613 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 10:09:41,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:09:41,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:41,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:41,821 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:09:41,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:41,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252174528] [2025-03-04 10:09:41,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252174528] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:41,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61191072] [2025-03-04 10:09:41,821 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:41,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:41,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:41,823 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:41,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:09:41,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 10:09:41,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:09:41,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:41,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:41,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:09:41,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:41,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2025-03-04 10:09:41,972 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:09:41,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:09:41,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61191072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:41,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:09:41,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-03-04 10:09:41,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113835857] [2025-03-04 10:09:41,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:41,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:09:41,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:41,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:09:41,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:09:42,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 84 [2025-03-04 10:09:42,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 88 transitions, 400 flow. Second operand has 8 states, 8 states have (on average 37.625) internal successors, (301), 8 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:42,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:42,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 84 [2025-03-04 10:09:42,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:42,698 INFO L124 PetriNetUnfolderBase]: 5200/8417 cut-off events. [2025-03-04 10:09:42,698 INFO L125 PetriNetUnfolderBase]: For 12744/14078 co-relation queries the response was YES. [2025-03-04 10:09:42,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23184 conditions, 8417 events. 5200/8417 cut-off events. For 12744/14078 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 55175 event pairs, 1753 based on Foata normal form. 428/8440 useless extension candidates. Maximal degree in co-relation 23166. Up to 3270 conditions per place. [2025-03-04 10:09:42,725 INFO L140 encePairwiseOnDemand]: 72/84 looper letters, 170 selfloop transitions, 14 changer transitions 0/204 dead transitions. [2025-03-04 10:09:42,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 204 transitions, 1382 flow [2025-03-04 10:09:42,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:09:42,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:09:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 427 transitions. [2025-03-04 10:09:42,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2025-03-04 10:09:42,726 INFO L175 Difference]: Start difference. First operand has 105 places, 88 transitions, 400 flow. Second operand 9 states and 427 transitions. [2025-03-04 10:09:42,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 204 transitions, 1382 flow [2025-03-04 10:09:42,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 204 transitions, 1253 flow, removed 33 selfloop flow, removed 6 redundant places. [2025-03-04 10:09:42,741 INFO L231 Difference]: Finished difference. Result has 109 places, 91 transitions, 412 flow [2025-03-04 10:09:42,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=412, PETRI_PLACES=109, PETRI_TRANSITIONS=91} [2025-03-04 10:09:42,742 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 25 predicate places. [2025-03-04 10:09:42,742 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 91 transitions, 412 flow [2025-03-04 10:09:42,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 37.625) internal successors, (301), 8 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:42,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:42,742 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:42,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:09:42,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 10:09:42,943 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:09:42,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:42,943 INFO L85 PathProgramCache]: Analyzing trace with hash -104918663, now seen corresponding path program 1 times [2025-03-04 10:09:42,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:42,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212595881] [2025-03-04 10:09:42,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:42,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:42,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:09:42,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:09:42,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:42,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:43,083 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:43,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:43,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212595881] [2025-03-04 10:09:43,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212595881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:43,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180920378] [2025-03-04 10:09:43,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:43,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:43,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:43,089 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:43,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:09:43,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:09:43,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:09:43,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:43,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:43,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:09:43,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:43,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:09:43,269 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:43,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:43,435 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:43,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180920378] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:43,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:43,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-03-04 10:09:43,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807032106] [2025-03-04 10:09:43,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:43,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:09:43,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:43,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:09:43,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:09:43,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 84 [2025-03-04 10:09:43,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 91 transitions, 412 flow. Second operand has 22 states, 22 states have (on average 28.40909090909091) internal successors, (625), 22 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:43,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:43,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 84 [2025-03-04 10:09:43,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:45,114 INFO L124 PetriNetUnfolderBase]: 10479/15699 cut-off events. [2025-03-04 10:09:45,115 INFO L125 PetriNetUnfolderBase]: For 16442/18027 co-relation queries the response was YES. [2025-03-04 10:09:45,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45641 conditions, 15699 events. 10479/15699 cut-off events. For 16442/18027 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 92351 event pairs, 3722 based on Foata normal form. 1151/16125 useless extension candidates. Maximal degree in co-relation 45623. Up to 4377 conditions per place. [2025-03-04 10:09:45,190 INFO L140 encePairwiseOnDemand]: 75/84 looper letters, 187 selfloop transitions, 14 changer transitions 0/213 dead transitions. [2025-03-04 10:09:45,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 213 transitions, 1295 flow [2025-03-04 10:09:45,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:09:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:09:45,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 419 transitions. [2025-03-04 10:09:45,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4988095238095238 [2025-03-04 10:09:45,192 INFO L175 Difference]: Start difference. First operand has 109 places, 91 transitions, 412 flow. Second operand 10 states and 419 transitions. [2025-03-04 10:09:45,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 213 transitions, 1295 flow [2025-03-04 10:09:45,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 213 transitions, 1271 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:09:45,231 INFO L231 Difference]: Finished difference. Result has 114 places, 94 transitions, 459 flow [2025-03-04 10:09:45,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=459, PETRI_PLACES=114, PETRI_TRANSITIONS=94} [2025-03-04 10:09:45,232 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 30 predicate places. [2025-03-04 10:09:45,232 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 94 transitions, 459 flow [2025-03-04 10:09:45,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 28.40909090909091) internal successors, (625), 22 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:45,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:45,232 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:45,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:09:45,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 10:09:45,433 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:09:45,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:45,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1817157804, now seen corresponding path program 1 times [2025-03-04 10:09:45,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:45,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80853896] [2025-03-04 10:09:45,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:45,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:45,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:09:45,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:09:45,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:45,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:45,530 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:45,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:45,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80853896] [2025-03-04 10:09:45,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80853896] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:45,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947061705] [2025-03-04 10:09:45,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:45,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:45,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:45,534 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:45,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:09:45,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:09:45,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:09:45,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:45,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:45,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:09:45,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:45,685 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:45,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:45,757 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:09:45,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947061705] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:45,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:45,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-04 10:09:45,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342644659] [2025-03-04 10:09:45,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:45,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:09:45,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:45,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:09:45,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:09:45,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 84 [2025-03-04 10:09:45,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 94 transitions, 459 flow. Second operand has 19 states, 19 states have (on average 39.05263157894737) internal successors, (742), 19 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:45,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:45,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 84 [2025-03-04 10:09:45,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:47,078 INFO L124 PetriNetUnfolderBase]: 8768/14373 cut-off events. [2025-03-04 10:09:47,078 INFO L125 PetriNetUnfolderBase]: For 21317/22809 co-relation queries the response was YES. [2025-03-04 10:09:47,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43505 conditions, 14373 events. 8768/14373 cut-off events. For 21317/22809 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 101637 event pairs, 4313 based on Foata normal form. 706/14162 useless extension candidates. Maximal degree in co-relation 43485. Up to 5897 conditions per place. [2025-03-04 10:09:47,138 INFO L140 encePairwiseOnDemand]: 74/84 looper letters, 161 selfloop transitions, 20 changer transitions 0/205 dead transitions. [2025-03-04 10:09:47,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 205 transitions, 1371 flow [2025-03-04 10:09:47,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:09:47,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:09:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 493 transitions. [2025-03-04 10:09:47,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5869047619047619 [2025-03-04 10:09:47,139 INFO L175 Difference]: Start difference. First operand has 114 places, 94 transitions, 459 flow. Second operand 10 states and 493 transitions. [2025-03-04 10:09:47,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 205 transitions, 1371 flow [2025-03-04 10:09:47,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 205 transitions, 1274 flow, removed 27 selfloop flow, removed 6 redundant places. [2025-03-04 10:09:47,167 INFO L231 Difference]: Finished difference. Result has 123 places, 103 transitions, 577 flow [2025-03-04 10:09:47,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=577, PETRI_PLACES=123, PETRI_TRANSITIONS=103} [2025-03-04 10:09:47,167 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 39 predicate places. [2025-03-04 10:09:47,167 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 103 transitions, 577 flow [2025-03-04 10:09:47,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 39.05263157894737) internal successors, (742), 19 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:47,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:47,168 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:47,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:09:47,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:09:47,368 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:09:47,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:47,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1467045449, now seen corresponding path program 2 times [2025-03-04 10:09:47,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:47,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646033005] [2025-03-04 10:09:47,369 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:47,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:47,374 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 10:09:47,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:09:47,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:47,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:47,514 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:09:47,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:47,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646033005] [2025-03-04 10:09:47,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646033005] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:47,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971243680] [2025-03-04 10:09:47,514 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:47,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:47,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:47,517 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:47,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:09:47,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 10:09:47,572 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:09:47,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:47,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:47,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:09:47,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:47,737 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:09:47,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:47,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-04 10:09:48,025 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:09:48,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971243680] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:48,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:48,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2025-03-04 10:09:48,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294941690] [2025-03-04 10:09:48,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:48,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 10:09:48,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:48,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 10:09:48,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:09:48,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 84 [2025-03-04 10:09:48,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 103 transitions, 577 flow. Second operand has 25 states, 25 states have (on average 30.56) internal successors, (764), 25 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:48,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:48,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 84 [2025-03-04 10:09:48,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:50,884 INFO L124 PetriNetUnfolderBase]: 14693/21506 cut-off events. [2025-03-04 10:09:50,884 INFO L125 PetriNetUnfolderBase]: For 27022/29798 co-relation queries the response was YES. [2025-03-04 10:09:50,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66242 conditions, 21506 events. 14693/21506 cut-off events. For 27022/29798 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 133802 event pairs, 2692 based on Foata normal form. 923/21032 useless extension candidates. Maximal degree in co-relation 66218. Up to 3133 conditions per place. [2025-03-04 10:09:50,983 INFO L140 encePairwiseOnDemand]: 76/84 looper letters, 312 selfloop transitions, 29 changer transitions 0/357 dead transitions. [2025-03-04 10:09:50,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 357 transitions, 2310 flow [2025-03-04 10:09:50,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:09:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 10:09:50,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 718 transitions. [2025-03-04 10:09:50,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5028011204481793 [2025-03-04 10:09:50,985 INFO L175 Difference]: Start difference. First operand has 123 places, 103 transitions, 577 flow. Second operand 17 states and 718 transitions. [2025-03-04 10:09:50,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 357 transitions, 2310 flow [2025-03-04 10:09:51,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 357 transitions, 2299 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:51,047 INFO L231 Difference]: Finished difference. Result has 139 places, 107 transitions, 673 flow [2025-03-04 10:09:51,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=673, PETRI_PLACES=139, PETRI_TRANSITIONS=107} [2025-03-04 10:09:51,048 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 55 predicate places. [2025-03-04 10:09:51,048 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 107 transitions, 673 flow [2025-03-04 10:09:51,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 30.56) internal successors, (764), 25 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:51,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:51,049 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:51,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:09:51,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:09:51,249 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:09:51,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:51,250 INFO L85 PathProgramCache]: Analyzing trace with hash -113441729, now seen corresponding path program 1 times [2025-03-04 10:09:51,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:51,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305954978] [2025-03-04 10:09:51,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:51,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:51,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:09:51,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:09:51,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:51,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:51,335 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:09:51,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:51,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305954978] [2025-03-04 10:09:51,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305954978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:51,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627315461] [2025-03-04 10:09:51,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:51,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:51,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:51,337 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:51,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:09:51,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:09:51,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:09:51,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:51,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:51,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:09:51,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:09:51,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:09:51,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627315461] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:51,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:51,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-04 10:09:51,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055825286] [2025-03-04 10:09:51,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:51,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:09:51,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:51,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:09:51,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:09:51,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 84 [2025-03-04 10:09:51,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 107 transitions, 673 flow. Second operand has 19 states, 19 states have (on average 39.1578947368421) internal successors, (744), 19 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:51,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:51,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 84 [2025-03-04 10:09:51,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:52,910 INFO L124 PetriNetUnfolderBase]: 9275/15073 cut-off events. [2025-03-04 10:09:52,910 INFO L125 PetriNetUnfolderBase]: For 31971/32946 co-relation queries the response was YES. [2025-03-04 10:09:52,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49563 conditions, 15073 events. 9275/15073 cut-off events. For 31971/32946 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 104065 event pairs, 4966 based on Foata normal form. 456/14583 useless extension candidates. Maximal degree in co-relation 49535. Up to 7481 conditions per place. [2025-03-04 10:09:52,980 INFO L140 encePairwiseOnDemand]: 74/84 looper letters, 156 selfloop transitions, 20 changer transitions 0/203 dead transitions. [2025-03-04 10:09:52,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 203 transitions, 1562 flow [2025-03-04 10:09:52,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:09:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:09:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 490 transitions. [2025-03-04 10:09:52,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-04 10:09:52,981 INFO L175 Difference]: Start difference. First operand has 139 places, 107 transitions, 673 flow. Second operand 10 states and 490 transitions. [2025-03-04 10:09:52,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 203 transitions, 1562 flow [2025-03-04 10:09:53,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 203 transitions, 1383 flow, removed 16 selfloop flow, removed 13 redundant places. [2025-03-04 10:09:53,030 INFO L231 Difference]: Finished difference. Result has 139 places, 113 transitions, 694 flow [2025-03-04 10:09:53,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=694, PETRI_PLACES=139, PETRI_TRANSITIONS=113} [2025-03-04 10:09:53,030 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 55 predicate places. [2025-03-04 10:09:53,030 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 113 transitions, 694 flow [2025-03-04 10:09:53,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 39.1578947368421) internal successors, (744), 19 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:53,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:53,031 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:53,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:53,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:09:53,231 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:09:53,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:53,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1337082338, now seen corresponding path program 2 times [2025-03-04 10:09:53,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:53,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667406459] [2025-03-04 10:09:53,232 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:53,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:53,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-04 10:09:53,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:09:53,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:53,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:53,381 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 10:09:53,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:53,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667406459] [2025-03-04 10:09:53,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667406459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:53,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487449905] [2025-03-04 10:09:53,381 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:53,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:53,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:53,383 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:09:53,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:09:53,424 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-04 10:09:53,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:09:53,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:53,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:53,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:09:53,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:53,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:09:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:09:53,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:53,831 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:09:53,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487449905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:53,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:53,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2025-03-04 10:09:53,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404766204] [2025-03-04 10:09:53,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:53,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 10:09:53,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:53,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 10:09:53,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:09:54,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 84 [2025-03-04 10:09:54,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 113 transitions, 694 flow. Second operand has 25 states, 25 states have (on average 29.8) internal successors, (745), 25 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:54,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:54,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 84 [2025-03-04 10:09:54,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:56,961 INFO L124 PetriNetUnfolderBase]: 15925/22985 cut-off events. [2025-03-04 10:09:56,962 INFO L125 PetriNetUnfolderBase]: For 37273/39089 co-relation queries the response was YES. [2025-03-04 10:09:57,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72540 conditions, 22985 events. 15925/22985 cut-off events. For 37273/39089 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 139779 event pairs, 2714 based on Foata normal form. 698/22219 useless extension candidates. Maximal degree in co-relation 72514. Up to 2867 conditions per place. [2025-03-04 10:09:57,201 INFO L140 encePairwiseOnDemand]: 76/84 looper letters, 310 selfloop transitions, 29 changer transitions 0/358 dead transitions. [2025-03-04 10:09:57,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 358 transitions, 2510 flow [2025-03-04 10:09:57,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:09:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 10:09:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 692 transitions. [2025-03-04 10:09:57,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.484593837535014 [2025-03-04 10:09:57,203 INFO L175 Difference]: Start difference. First operand has 139 places, 113 transitions, 694 flow. Second operand 17 states and 692 transitions. [2025-03-04 10:09:57,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 358 transitions, 2510 flow [2025-03-04 10:09:57,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 358 transitions, 2488 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 10:09:57,283 INFO L231 Difference]: Finished difference. Result has 152 places, 117 transitions, 779 flow [2025-03-04 10:09:57,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=779, PETRI_PLACES=152, PETRI_TRANSITIONS=117} [2025-03-04 10:09:57,283 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 68 predicate places. [2025-03-04 10:09:57,283 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 117 transitions, 779 flow [2025-03-04 10:09:57,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 29.8) internal successors, (745), 25 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:57,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:57,284 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:57,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 10:09:57,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:09:57,488 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:09:57,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:57,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1805657054, now seen corresponding path program 1 times [2025-03-04 10:09:57,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:57,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044294347] [2025-03-04 10:09:57,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:57,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:57,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 10:09:57,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:09:57,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:57,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:57,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:09:57,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:57,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044294347] [2025-03-04 10:09:57,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044294347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:57,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:57,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:09:57,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021227586] [2025-03-04 10:09:57,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:57,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:09:57,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:57,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:09:57,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:09:57,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 84 [2025-03-04 10:09:57,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 117 transitions, 779 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:57,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:57,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 84 [2025-03-04 10:09:57,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:58,820 INFO L124 PetriNetUnfolderBase]: 8744/14842 cut-off events. [2025-03-04 10:09:58,820 INFO L125 PetriNetUnfolderBase]: For 37703/38757 co-relation queries the response was YES. [2025-03-04 10:09:58,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49998 conditions, 14842 events. 8744/14842 cut-off events. For 37703/38757 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 107329 event pairs, 5012 based on Foata normal form. 506/14225 useless extension candidates. Maximal degree in co-relation 49969. Up to 9568 conditions per place. [2025-03-04 10:09:58,926 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 107 selfloop transitions, 7 changer transitions 0/144 dead transitions. [2025-03-04 10:09:58,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 144 transitions, 1213 flow [2025-03-04 10:09:58,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:09:58,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:09:58,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2025-03-04 10:09:58,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6279761904761905 [2025-03-04 10:09:58,927 INFO L175 Difference]: Start difference. First operand has 152 places, 117 transitions, 779 flow. Second operand 4 states and 211 transitions. [2025-03-04 10:09:58,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 144 transitions, 1213 flow [2025-03-04 10:09:58,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 144 transitions, 1061 flow, removed 25 selfloop flow, removed 13 redundant places. [2025-03-04 10:09:58,998 INFO L231 Difference]: Finished difference. Result has 142 places, 114 transitions, 668 flow [2025-03-04 10:09:58,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=668, PETRI_PLACES=142, PETRI_TRANSITIONS=114} [2025-03-04 10:09:58,999 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 58 predicate places. [2025-03-04 10:09:58,999 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 114 transitions, 668 flow [2025-03-04 10:09:58,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:58,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:58,999 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:58,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:09:58,999 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:09:58,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:58,999 INFO L85 PathProgramCache]: Analyzing trace with hash 676801643, now seen corresponding path program 1 times [2025-03-04 10:09:58,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:59,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249579061] [2025-03-04 10:09:59,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:59,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:59,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 10:09:59,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 10:09:59,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:59,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:59,046 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:09:59,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:59,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249579061] [2025-03-04 10:09:59,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249579061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:59,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:59,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:09:59,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646812706] [2025-03-04 10:09:59,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:59,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:09:59,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:59,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:09:59,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:09:59,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 84 [2025-03-04 10:09:59,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 114 transitions, 668 flow. Second operand has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:59,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:59,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 84 [2025-03-04 10:09:59,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:59,998 INFO L124 PetriNetUnfolderBase]: 8464/14463 cut-off events. [2025-03-04 10:09:59,999 INFO L125 PetriNetUnfolderBase]: For 27455/28599 co-relation queries the response was YES. [2025-03-04 10:10:00,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44807 conditions, 14463 events. 8464/14463 cut-off events. For 27455/28599 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 105426 event pairs, 4994 based on Foata normal form. 539/13894 useless extension candidates. Maximal degree in co-relation 44783. Up to 9327 conditions per place. [2025-03-04 10:10:00,080 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 100 selfloop transitions, 7 changer transitions 0/137 dead transitions. [2025-03-04 10:10:00,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 137 transitions, 1008 flow [2025-03-04 10:10:00,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:10:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:10:00,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2025-03-04 10:10:00,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-04 10:10:00,081 INFO L175 Difference]: Start difference. First operand has 142 places, 114 transitions, 668 flow. Second operand 4 states and 210 transitions. [2025-03-04 10:10:00,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 137 transitions, 1008 flow [2025-03-04 10:10:00,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 137 transitions, 986 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:10:00,129 INFO L231 Difference]: Finished difference. Result has 141 places, 111 transitions, 638 flow [2025-03-04 10:10:00,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=638, PETRI_PLACES=141, PETRI_TRANSITIONS=111} [2025-03-04 10:10:00,129 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 57 predicate places. [2025-03-04 10:10:00,129 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 111 transitions, 638 flow [2025-03-04 10:10:00,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:00,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:00,130 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:00,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:10:00,130 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:10:00,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:00,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1591955404, now seen corresponding path program 1 times [2025-03-04 10:10:00,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:00,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127436292] [2025-03-04 10:10:00,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:00,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:00,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 10:10:00,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 10:10:00,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:00,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:00,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:10:00,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:00,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127436292] [2025-03-04 10:10:00,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127436292] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:00,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260366633] [2025-03-04 10:10:00,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:00,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:00,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:00,302 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:10:00,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:10:00,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 10:10:00,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 10:10:00,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:00,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:00,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 10:10:00,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:00,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-03-04 10:10:00,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2025-03-04 10:10:00,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:10:00,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:10:00,568 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:10:00,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260366633] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:10:00,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:10:00,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 8] total 18 [2025-03-04 10:10:00,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33834244] [2025-03-04 10:10:00,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:10:00,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:10:00,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:00,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:10:00,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:10:00,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 84 [2025-03-04 10:10:00,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 111 transitions, 638 flow. Second operand has 18 states, 18 states have (on average 36.611111111111114) internal successors, (659), 18 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:00,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:00,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 84 [2025-03-04 10:10:00,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:05,155 INFO L124 PetriNetUnfolderBase]: 28129/43007 cut-off events. [2025-03-04 10:10:05,155 INFO L125 PetriNetUnfolderBase]: For 76728/79880 co-relation queries the response was YES. [2025-03-04 10:10:05,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130706 conditions, 43007 events. 28129/43007 cut-off events. For 76728/79880 co-relation queries the response was YES. Maximal size of possible extension queue 918. Compared 308022 event pairs, 321 based on Foata normal form. 856/41573 useless extension candidates. Maximal degree in co-relation 130682. Up to 6337 conditions per place. [2025-03-04 10:10:05,365 INFO L140 encePairwiseOnDemand]: 63/84 looper letters, 475 selfloop transitions, 123 changer transitions 340/959 dead transitions. [2025-03-04 10:10:05,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 959 transitions, 6952 flow [2025-03-04 10:10:05,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-04 10:10:05,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-04 10:10:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 2549 transitions. [2025-03-04 10:10:05,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48167044595616026 [2025-03-04 10:10:05,368 INFO L175 Difference]: Start difference. First operand has 141 places, 111 transitions, 638 flow. Second operand 63 states and 2549 transitions. [2025-03-04 10:10:05,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 959 transitions, 6952 flow [2025-03-04 10:10:05,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 959 transitions, 6844 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:10:05,549 INFO L231 Difference]: Finished difference. Result has 245 places, 212 transitions, 1787 flow [2025-03-04 10:10:05,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=1787, PETRI_PLACES=245, PETRI_TRANSITIONS=212} [2025-03-04 10:10:05,550 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 161 predicate places. [2025-03-04 10:10:05,550 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 212 transitions, 1787 flow [2025-03-04 10:10:05,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 36.611111111111114) internal successors, (659), 18 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:05,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:05,551 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:05,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:10:05,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:05,755 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:10:05,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:05,755 INFO L85 PathProgramCache]: Analyzing trace with hash 136411636, now seen corresponding path program 2 times [2025-03-04 10:10:05,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:05,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183279210] [2025-03-04 10:10:05,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:10:05,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:05,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-03-04 10:10:05,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 59 statements. [2025-03-04 10:10:05,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:10:05,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:05,827 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:10:05,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:05,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183279210] [2025-03-04 10:10:05,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183279210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:05,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:05,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:10:05,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464739465] [2025-03-04 10:10:05,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:05,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:10:05,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:05,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:10:05,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:10:05,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 84 [2025-03-04 10:10:05,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 212 transitions, 1787 flow. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:05,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:05,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 84 [2025-03-04 10:10:05,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:10,116 INFO L124 PetriNetUnfolderBase]: 21488/37239 cut-off events. [2025-03-04 10:10:10,116 INFO L125 PetriNetUnfolderBase]: For 445763/449073 co-relation queries the response was YES. [2025-03-04 10:10:10,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174908 conditions, 37239 events. 21488/37239 cut-off events. For 445763/449073 co-relation queries the response was YES. Maximal size of possible extension queue 913. Compared 308519 event pairs, 7887 based on Foata normal form. 564/35901 useless extension candidates. Maximal degree in co-relation 174839. Up to 20149 conditions per place. [2025-03-04 10:10:10,426 INFO L140 encePairwiseOnDemand]: 76/84 looper letters, 136 selfloop transitions, 9 changer transitions 103/325 dead transitions. [2025-03-04 10:10:10,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 325 transitions, 3318 flow [2025-03-04 10:10:10,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:10:10,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:10:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 293 transitions. [2025-03-04 10:10:10,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5813492063492064 [2025-03-04 10:10:10,427 INFO L175 Difference]: Start difference. First operand has 245 places, 212 transitions, 1787 flow. Second operand 6 states and 293 transitions. [2025-03-04 10:10:10,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 325 transitions, 3318 flow [2025-03-04 10:10:11,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 325 transitions, 3028 flow, removed 80 selfloop flow, removed 29 redundant places. [2025-03-04 10:10:11,154 INFO L231 Difference]: Finished difference. Result has 200 places, 215 transitions, 1686 flow [2025-03-04 10:10:11,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=1595, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1686, PETRI_PLACES=200, PETRI_TRANSITIONS=215} [2025-03-04 10:10:11,154 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 116 predicate places. [2025-03-04 10:10:11,155 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 215 transitions, 1686 flow [2025-03-04 10:10:11,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:11,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:11,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:11,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 10:10:11,155 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:10:11,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:11,155 INFO L85 PathProgramCache]: Analyzing trace with hash -842515972, now seen corresponding path program 3 times [2025-03-04 10:10:11,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:11,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183459921] [2025-03-04 10:10:11,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:10:11,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:11,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 3 equivalence classes. [2025-03-04 10:10:11,291 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 43 of 59 statements. [2025-03-04 10:10:11,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:10:11,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:11,504 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:10:11,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:11,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183459921] [2025-03-04 10:10:11,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183459921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:11,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:11,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 10:10:11,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424548873] [2025-03-04 10:10:11,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:11,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:10:11,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:11,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:10:11,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:10:12,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 84 [2025-03-04 10:10:12,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 215 transitions, 1686 flow. Second operand has 14 states, 14 states have (on average 33.57142857142857) internal successors, (470), 14 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:12,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:12,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 84 [2025-03-04 10:10:12,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:24,850 INFO L124 PetriNetUnfolderBase]: 63358/95271 cut-off events. [2025-03-04 10:10:24,850 INFO L125 PetriNetUnfolderBase]: For 1064098/1068480 co-relation queries the response was YES. [2025-03-04 10:10:25,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426407 conditions, 95271 events. 63358/95271 cut-off events. For 1064098/1068480 co-relation queries the response was YES. Maximal size of possible extension queue 1397. Compared 689979 event pairs, 7166 based on Foata normal form. 75/92404 useless extension candidates. Maximal degree in co-relation 426356. Up to 17218 conditions per place. [2025-03-04 10:10:25,851 INFO L140 encePairwiseOnDemand]: 65/84 looper letters, 876 selfloop transitions, 289 changer transitions 487/1684 dead transitions. [2025-03-04 10:10:25,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 1684 transitions, 16100 flow [2025-03-04 10:10:25,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2025-03-04 10:10:25,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2025-03-04 10:10:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 3720 transitions. [2025-03-04 10:10:25,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-03-04 10:10:25,855 INFO L175 Difference]: Start difference. First operand has 200 places, 215 transitions, 1686 flow. Second operand 93 states and 3720 transitions. [2025-03-04 10:10:25,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 1684 transitions, 16100 flow [2025-03-04 10:10:27,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 1684 transitions, 15986 flow, removed 51 selfloop flow, removed 3 redundant places. [2025-03-04 10:10:27,414 INFO L231 Difference]: Finished difference. Result has 356 places, 458 transitions, 4823 flow [2025-03-04 10:10:27,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=1625, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=93, PETRI_FLOW=4823, PETRI_PLACES=356, PETRI_TRANSITIONS=458} [2025-03-04 10:10:27,414 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 272 predicate places. [2025-03-04 10:10:27,414 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 458 transitions, 4823 flow [2025-03-04 10:10:27,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 33.57142857142857) internal successors, (470), 14 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:27,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:27,415 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:27,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 10:10:27,415 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:10:27,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:27,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1213355646, now seen corresponding path program 4 times [2025-03-04 10:10:27,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:27,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718883977] [2025-03-04 10:10:27,415 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:10:27,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:27,420 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-03-04 10:10:27,426 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 10:10:27,426 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:10:27,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:27,549 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:10:27,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:27,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718883977] [2025-03-04 10:10:27,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718883977] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:27,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73064787] [2025-03-04 10:10:27,550 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:10:27,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:27,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:27,552 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:10:27,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:10:27,607 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-03-04 10:10:27,636 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 10:10:27,636 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:10:27,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:27,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:10:27,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:27,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2025-03-04 10:10:27,707 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:10:27,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:10:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:10:27,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73064787] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:10:27,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:10:27,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 10:10:27,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769267719] [2025-03-04 10:10:27,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:10:27,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:10:27,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:27,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:10:27,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:10:28,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 84 [2025-03-04 10:10:28,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 458 transitions, 4823 flow. Second operand has 13 states, 13 states have (on average 40.53846153846154) internal successors, (527), 13 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:28,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:28,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 84 [2025-03-04 10:10:28,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand