./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/parallel-parallel-sum-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 b1e99af7c76570461a4b0ac70d664412f250ec04f47fd9ca8c0f85236f1348c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:26:17,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:26:17,225 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:26:17,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:26:17,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:26:17,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:26:17,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:26:17,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:26:17,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:26:17,248 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:26:17,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:26:17,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:26:17,248 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:26:17,248 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:26:17,250 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:26:17,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:26:17,250 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:26:17,250 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:26:17,251 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:26:17,251 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:26:17,251 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:26:17,251 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:26:17,251 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:26:17,251 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:26:17,251 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:26:17,251 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:26:17,251 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:26:17,251 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:26:17,251 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:26:17,251 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:26:17,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:26:17,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:26:17,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:26:17,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:26:17,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:26:17,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:26:17,251 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:26:17,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:26:17,251 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:26:17,251 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:26:17,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:26:17,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:26:17,252 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 -> b1e99af7c76570461a4b0ac70d664412f250ec04f47fd9ca8c0f85236f1348c6 [2025-03-17 14:26:17,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:26:17,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:26:17,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:26:17,500 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:26:17,500 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:26:17,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c [2025-03-17 14:26:18,708 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87ca68aff/6b42ab2df7ab4b1d893b833620be8211/FLAGd3b1f521f [2025-03-17 14:26:18,946 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:26:18,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c [2025-03-17 14:26:18,954 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87ca68aff/6b42ab2df7ab4b1d893b833620be8211/FLAGd3b1f521f [2025-03-17 14:26:18,970 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87ca68aff/6b42ab2df7ab4b1d893b833620be8211 [2025-03-17 14:26:18,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:26:18,973 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:26:18,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:26:18,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:26:18,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:26:18,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:26:18" (1/1) ... [2025-03-17 14:26:18,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e23a052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:18, skipping insertion in model container [2025-03-17 14:26:18,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:26:18" (1/1) ... [2025-03-17 14:26:18,997 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:26:19,145 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 14:26:19,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:26:19,155 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:26:19,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:26:19,198 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:26:19,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:19 WrapperNode [2025-03-17 14:26:19,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:26:19,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:26:19,201 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:26:19,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:26:19,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:19" (1/1) ... [2025-03-17 14:26:19,211 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:19" (1/1) ... [2025-03-17 14:26:19,236 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 19, calls inlined = 25, statements flattened = 290 [2025-03-17 14:26:19,239 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:26:19,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:26:19,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:26:19,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:26:19,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:19" (1/1) ... [2025-03-17 14:26:19,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:19" (1/1) ... [2025-03-17 14:26:19,253 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:19" (1/1) ... [2025-03-17 14:26:19,273 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 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-17 14:26:19,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:19" (1/1) ... [2025-03-17 14:26:19,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:19" (1/1) ... [2025-03-17 14:26:19,286 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:19" (1/1) ... [2025-03-17 14:26:19,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:19" (1/1) ... [2025-03-17 14:26:19,291 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:19" (1/1) ... [2025-03-17 14:26:19,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:19" (1/1) ... [2025-03-17 14:26:19,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:26:19,299 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:26:19,299 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:26:19,299 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:26:19,300 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:19" (1/1) ... [2025-03-17 14:26:19,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:26:19,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:26:19,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:26:19,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:26:19,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:26:19,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:26:19,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:26:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:26:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:26:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 14:26:19,351 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 14:26:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 14:26:19,351 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 14:26:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 14:26:19,351 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 14:26:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-17 14:26:19,351 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-17 14:26:19,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:26:19,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:26:19,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 14:26:19,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 14:26:19,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:26:19,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:26:19,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:26:19,353 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:26:19,432 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:26:19,434 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:26:19,785 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:26:19,785 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:26:20,065 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:26:20,065 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:26:20,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:26:20 BoogieIcfgContainer [2025-03-17 14:26:20,066 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:26:20,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:26:20,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:26:20,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:26:20,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:26:18" (1/3) ... [2025-03-17 14:26:20,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33189b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:26:20, skipping insertion in model container [2025-03-17 14:26:20,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:26:19" (2/3) ... [2025-03-17 14:26:20,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33189b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:26:20, skipping insertion in model container [2025-03-17 14:26:20,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:26:20" (3/3) ... [2025-03-17 14:26:20,073 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1.wvr.c [2025-03-17 14:26:20,085 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:26:20,086 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-1.wvr.c that has 5 procedures, 59 locations, 1 initial locations, 5 loop locations, and 12 error locations. [2025-03-17 14:26:20,086 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:26:20,145 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-17 14:26:20,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 67 transitions, 162 flow [2025-03-17 14:26:20,204 INFO L124 PetriNetUnfolderBase]: 9/63 cut-off events. [2025-03-17 14:26:20,206 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 14:26:20,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 63 events. 9/63 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 139 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2025-03-17 14:26:20,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 67 transitions, 162 flow [2025-03-17 14:26:20,215 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 62 transitions, 148 flow [2025-03-17 14:26:20,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:26:20,237 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;@22946a97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:26:20,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-17 14:26:20,240 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:26:20,240 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:26:20,241 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:26:20,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:20,241 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:26:20,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:26:20,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:20,246 INFO L85 PathProgramCache]: Analyzing trace with hash 795434, now seen corresponding path program 1 times [2025-03-17 14:26:20,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:20,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108907486] [2025-03-17 14:26:20,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:20,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:20,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:26:20,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:26:20,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:20,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:20,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:20,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:20,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108907486] [2025-03-17 14:26:20,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108907486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:20,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:26:20,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:26:20,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402428068] [2025-03-17 14:26:20,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:20,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:26:20,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:20,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:26:20,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:26:20,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 67 [2025-03-17 14:26:20,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:20,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:20,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 67 [2025-03-17 14:26:20,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:24,188 INFO L124 PetriNetUnfolderBase]: 52293/67879 cut-off events. [2025-03-17 14:26:24,188 INFO L125 PetriNetUnfolderBase]: For 2871/2871 co-relation queries the response was YES. [2025-03-17 14:26:24,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138059 conditions, 67879 events. 52293/67879 cut-off events. For 2871/2871 co-relation queries the response was YES. Maximal size of possible extension queue 2704. Compared 380351 event pairs, 45690 based on Foata normal form. 1/47888 useless extension candidates. Maximal degree in co-relation 130861. Up to 67712 conditions per place. [2025-03-17 14:26:24,574 INFO L140 encePairwiseOnDemand]: 59/67 looper letters, 47 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-03-17 14:26:24,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 55 transitions, 232 flow [2025-03-17 14:26:24,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:26:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:26:24,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-03-17 14:26:24,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43781094527363185 [2025-03-17 14:26:24,585 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 148 flow. Second operand 3 states and 88 transitions. [2025-03-17 14:26:24,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 55 transitions, 232 flow [2025-03-17 14:26:24,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 216 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-17 14:26:24,643 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 122 flow [2025-03-17 14:26:24,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2025-03-17 14:26:24,649 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -9 predicate places. [2025-03-17 14:26:24,651 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 122 flow [2025-03-17 14:26:24,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:24,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:24,651 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:26:24,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:26:24,651 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:26:24,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:24,652 INFO L85 PathProgramCache]: Analyzing trace with hash 795435, now seen corresponding path program 1 times [2025-03-17 14:26:24,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:24,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317911153] [2025-03-17 14:26:24,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:24,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:24,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:26:24,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:26:24,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:24,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:24,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:24,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:24,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317911153] [2025-03-17 14:26:24,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317911153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:24,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:26:24,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:26:24,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259134856] [2025-03-17 14:26:24,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:24,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:26:24,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:24,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:26:24,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:26:24,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 67 [2025-03-17 14:26:24,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:24,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:24,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 67 [2025-03-17 14:26:24,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:27,681 INFO L124 PetriNetUnfolderBase]: 52294/67882 cut-off events. [2025-03-17 14:26:27,682 INFO L125 PetriNetUnfolderBase]: For 657/657 co-relation queries the response was YES. [2025-03-17 14:26:27,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136426 conditions, 67882 events. 52294/67882 cut-off events. For 657/657 co-relation queries the response was YES. Maximal size of possible extension queue 2704. Compared 380419 event pairs, 45690 based on Foata normal form. 0/47890 useless extension candidates. Maximal degree in co-relation 136404. Up to 67717 conditions per place. [2025-03-17 14:26:27,994 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 49 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-03-17 14:26:27,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 236 flow [2025-03-17 14:26:27,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:26:27,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:26:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-03-17 14:26:27,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3656716417910448 [2025-03-17 14:26:27,995 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 122 flow. Second operand 4 states and 98 transitions. [2025-03-17 14:26:27,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 236 flow [2025-03-17 14:26:27,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:26:27,997 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 145 flow [2025-03-17 14:26:27,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2025-03-17 14:26:27,998 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places. [2025-03-17 14:26:27,998 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 145 flow [2025-03-17 14:26:27,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:27,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:27,998 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:26:27,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:26:27,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:26:27,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:27,999 INFO L85 PathProgramCache]: Analyzing trace with hash 764437748, now seen corresponding path program 1 times [2025-03-17 14:26:27,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:27,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012555278] [2025-03-17 14:26:27,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:27,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:28,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:26:28,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:26:28,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:28,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:28,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:28,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:28,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012555278] [2025-03-17 14:26:28,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012555278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:26:28,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747792974] [2025-03-17 14:26:28,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:28,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:26:28,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:26:28,282 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:26:28,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:26:28,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:26:28,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:26:28,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:28,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:28,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:26:28,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:26:28,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-17 14:26:28,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:28,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:26:28,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:28,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747792974] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:26:28,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:26:28,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 14:26:28,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696796372] [2025-03-17 14:26:28,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:26:28,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:26:28,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:28,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:26:28,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:26:28,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 67 [2025-03-17 14:26:28,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 145 flow. Second operand has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:28,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:28,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 67 [2025-03-17 14:26:28,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:31,506 INFO L124 PetriNetUnfolderBase]: 52295/67884 cut-off events. [2025-03-17 14:26:31,506 INFO L125 PetriNetUnfolderBase]: For 657/657 co-relation queries the response was YES. [2025-03-17 14:26:31,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136442 conditions, 67884 events. 52295/67884 cut-off events. For 657/657 co-relation queries the response was YES. Maximal size of possible extension queue 2704. Compared 380442 event pairs, 45690 based on Foata normal form. 0/47891 useless extension candidates. Maximal degree in co-relation 136411. Up to 67714 conditions per place. [2025-03-17 14:26:31,787 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 45 selfloop transitions, 10 changer transitions 0/60 dead transitions. [2025-03-17 14:26:31,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 60 transitions, 263 flow [2025-03-17 14:26:31,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:26:31,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:26:31,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2025-03-17 14:26:31,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27052238805970147 [2025-03-17 14:26:31,789 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 145 flow. Second operand 8 states and 145 transitions. [2025-03-17 14:26:31,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 60 transitions, 263 flow [2025-03-17 14:26:31,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 60 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:26:31,790 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 170 flow [2025-03-17 14:26:31,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=170, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2025-03-17 14:26:31,791 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2025-03-17 14:26:31,791 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 170 flow [2025-03-17 14:26:31,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:31,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:31,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:31,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:26:31,995 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-17 14:26:31,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:26:31,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:31,996 INFO L85 PathProgramCache]: Analyzing trace with hash 260522496, now seen corresponding path program 1 times [2025-03-17 14:26:31,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:31,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031683132] [2025-03-17 14:26:31,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:31,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:32,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:26:32,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:26:32,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:32,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:32,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:32,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031683132] [2025-03-17 14:26:32,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031683132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:32,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:26:32,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:26:32,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161205601] [2025-03-17 14:26:32,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:32,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:26:32,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:32,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:26:32,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:26:32,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 67 [2025-03-17 14:26:32,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:32,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:32,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 67 [2025-03-17 14:26:32,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:33,988 INFO L124 PetriNetUnfolderBase]: 33133/43087 cut-off events. [2025-03-17 14:26:33,988 INFO L125 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2025-03-17 14:26:34,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86655 conditions, 43087 events. 33133/43087 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 1680. Compared 230082 event pairs, 28421 based on Foata normal form. 0/33509 useless extension candidates. Maximal degree in co-relation 86617. Up to 42950 conditions per place. [2025-03-17 14:26:34,146 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 47 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2025-03-17 14:26:34,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 264 flow [2025-03-17 14:26:34,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:26:34,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:26:34,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-03-17 14:26:34,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34701492537313433 [2025-03-17 14:26:34,147 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 170 flow. Second operand 4 states and 93 transitions. [2025-03-17 14:26:34,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 264 flow [2025-03-17 14:26:34,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 222 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-17 14:26:34,149 INFO L231 Difference]: Finished difference. Result has 57 places, 56 transitions, 128 flow [2025-03-17 14:26:34,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=57, PETRI_TRANSITIONS=56} [2025-03-17 14:26:34,149 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -9 predicate places. [2025-03-17 14:26:34,149 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 128 flow [2025-03-17 14:26:34,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:34,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:34,149 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:34,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:26:34,149 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:26:34,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:34,150 INFO L85 PathProgramCache]: Analyzing trace with hash 260522497, now seen corresponding path program 1 times [2025-03-17 14:26:34,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:34,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992160098] [2025-03-17 14:26:34,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:34,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:34,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:26:34,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:26:34,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:34,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:34,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:34,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:34,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992160098] [2025-03-17 14:26:34,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992160098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:34,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:26:34,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:26:34,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544920837] [2025-03-17 14:26:34,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:34,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:26:34,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:34,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:26:34,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:26:34,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2025-03-17 14:26:34,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 56 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:34,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:34,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2025-03-17 14:26:34,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:36,444 INFO L124 PetriNetUnfolderBase]: 44975/58986 cut-off events. [2025-03-17 14:26:36,445 INFO L125 PetriNetUnfolderBase]: For 728/728 co-relation queries the response was YES. [2025-03-17 14:26:36,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118602 conditions, 58986 events. 44975/58986 cut-off events. For 728/728 co-relation queries the response was YES. Maximal size of possible extension queue 2211. Compared 333406 event pairs, 39317 based on Foata normal form. 1505/47693 useless extension candidates. Maximal degree in co-relation 86609. Up to 42955 conditions per place. [2025-03-17 14:26:36,685 INFO L140 encePairwiseOnDemand]: 59/67 looper letters, 81 selfloop transitions, 3 changer transitions 1/90 dead transitions. [2025-03-17 14:26:36,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 90 transitions, 374 flow [2025-03-17 14:26:36,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:26:36,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:26:36,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-03-17 14:26:36,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.503731343283582 [2025-03-17 14:26:36,687 INFO L175 Difference]: Start difference. First operand has 57 places, 56 transitions, 128 flow. Second operand 4 states and 135 transitions. [2025-03-17 14:26:36,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 90 transitions, 374 flow [2025-03-17 14:26:36,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 90 transitions, 369 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:26:36,690 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 140 flow [2025-03-17 14:26:36,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2025-03-17 14:26:36,690 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -7 predicate places. [2025-03-17 14:26:36,690 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 140 flow [2025-03-17 14:26:36,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:36,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:36,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:36,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:26:36,691 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:26:36,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:36,691 INFO L85 PathProgramCache]: Analyzing trace with hash 2048096074, now seen corresponding path program 1 times [2025-03-17 14:26:36,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:36,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721833826] [2025-03-17 14:26:36,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:36,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:36,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:26:36,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:26:36,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:36,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:36,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:26:36,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:36,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721833826] [2025-03-17 14:26:36,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721833826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:26:36,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100321706] [2025-03-17 14:26:36,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:36,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:26:36,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:26:36,785 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:26:36,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:26:36,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:26:36,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:26:36,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:36,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:36,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:26:36,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:26:36,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:26:36,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:26:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:26:36,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100321706] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:26:36,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:26:36,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2025-03-17 14:26:36,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155491055] [2025-03-17 14:26:36,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:26:36,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:26:36,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:36,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:26:36,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:26:36,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2025-03-17 14:26:36,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 140 flow. Second operand has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:36,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:36,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2025-03-17 14:26:36,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:40,086 INFO L124 PetriNetUnfolderBase]: 56817/74887 cut-off events. [2025-03-17 14:26:40,086 INFO L125 PetriNetUnfolderBase]: For 4810/4810 co-relation queries the response was YES. [2025-03-17 14:26:40,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155316 conditions, 74887 events. 56817/74887 cut-off events. For 4810/4810 co-relation queries the response was YES. Maximal size of possible extension queue 2366. Compared 435897 event pairs, 50213 based on Foata normal form. 1504/60111 useless extension candidates. Maximal degree in co-relation 123334. Up to 42950 conditions per place. [2025-03-17 14:26:40,423 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 78 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2025-03-17 14:26:40,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 91 transitions, 392 flow [2025-03-17 14:26:40,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:26:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:26:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2025-03-17 14:26:40,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37100213219616207 [2025-03-17 14:26:40,424 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 140 flow. Second operand 7 states and 174 transitions. [2025-03-17 14:26:40,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 91 transitions, 392 flow [2025-03-17 14:26:40,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 91 transitions, 387 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:26:40,428 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 172 flow [2025-03-17 14:26:40,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=172, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2025-03-17 14:26:40,429 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2025-03-17 14:26:40,429 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 172 flow [2025-03-17 14:26:40,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:40,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:40,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:40,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:26:40,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 14:26:40,630 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:26:40,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:40,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1115703251, now seen corresponding path program 1 times [2025-03-17 14:26:40,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:40,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475086773] [2025-03-17 14:26:40,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:40,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:40,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:26:40,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:26:40,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:40,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:40,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:26:40,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:40,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475086773] [2025-03-17 14:26:40,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475086773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:40,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:26:40,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:26:40,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503398457] [2025-03-17 14:26:40,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:40,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:26:40,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:40,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:26:40,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:26:40,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2025-03-17 14:26:40,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:40,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:40,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2025-03-17 14:26:40,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:43,318 INFO L124 PetriNetUnfolderBase]: 49569/65362 cut-off events. [2025-03-17 14:26:43,318 INFO L125 PetriNetUnfolderBase]: For 7621/7621 co-relation queries the response was YES. [2025-03-17 14:26:43,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141012 conditions, 65362 events. 49569/65362 cut-off events. For 7621/7621 co-relation queries the response was YES. Maximal size of possible extension queue 2125. Compared 374453 event pairs, 43898 based on Foata normal form. 611/51882 useless extension candidates. Maximal degree in co-relation 96536. Up to 59025 conditions per place. [2025-03-17 14:26:43,561 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 49 selfloop transitions, 2 changer transitions 29/85 dead transitions. [2025-03-17 14:26:43,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 85 transitions, 396 flow [2025-03-17 14:26:43,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:26:43,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:26:43,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2025-03-17 14:26:43,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47761194029850745 [2025-03-17 14:26:43,563 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 172 flow. Second operand 4 states and 128 transitions. [2025-03-17 14:26:43,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 85 transitions, 396 flow [2025-03-17 14:26:43,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 85 transitions, 388 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:26:43,567 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 169 flow [2025-03-17 14:26:43,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2025-03-17 14:26:43,568 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2025-03-17 14:26:43,568 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 169 flow [2025-03-17 14:26:43,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:43,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:43,568 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:43,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:26:43,569 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:26:43,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:43,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1919385171, now seen corresponding path program 2 times [2025-03-17 14:26:43,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:43,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886453288] [2025-03-17 14:26:43,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:26:43,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:43,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-17 14:26:43,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:26:43,582 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:26:43,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:43,716 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:26:43,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:43,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886453288] [2025-03-17 14:26:43,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886453288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:26:43,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493775685] [2025-03-17 14:26:43,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:26:43,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:26:43,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:26:43,719 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:26:43,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:26:43,765 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-17 14:26:43,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:26:43,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:26:43,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:43,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 14:26:43,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:26:43,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 14:26:43,861 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:26:43,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:26:43,961 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:26:43,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493775685] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:26:43,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:26:43,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 4] total 11 [2025-03-17 14:26:43,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540691377] [2025-03-17 14:26:43,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:43,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:26:43,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:43,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:26:43,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:26:43,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2025-03-17 14:26:43,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:43,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:43,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2025-03-17 14:26:43,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:47,448 INFO L124 PetriNetUnfolderBase]: 58258/76181 cut-off events. [2025-03-17 14:26:47,449 INFO L125 PetriNetUnfolderBase]: For 13729/13729 co-relation queries the response was YES. [2025-03-17 14:26:47,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174223 conditions, 76181 events. 58258/76181 cut-off events. For 13729/13729 co-relation queries the response was YES. Maximal size of possible extension queue 2492. Compared 437028 event pairs, 48359 based on Foata normal form. 0/59924 useless extension candidates. Maximal degree in co-relation 174207. Up to 60180 conditions per place. [2025-03-17 14:26:47,776 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 81 selfloop transitions, 7 changer transitions 0/93 dead transitions. [2025-03-17 14:26:47,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 93 transitions, 448 flow [2025-03-17 14:26:47,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:26:47,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:26:47,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2025-03-17 14:26:47,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40049751243781095 [2025-03-17 14:26:47,777 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 169 flow. Second operand 6 states and 161 transitions. [2025-03-17 14:26:47,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 93 transitions, 448 flow [2025-03-17 14:26:47,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 93 transitions, 438 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-17 14:26:47,801 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 198 flow [2025-03-17 14:26:47,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=198, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2025-03-17 14:26:47,802 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 2 predicate places. [2025-03-17 14:26:47,802 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 198 flow [2025-03-17 14:26:47,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:47,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:47,802 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:47,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:26:48,003 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-17 14:26:48,003 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:26:48,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:48,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1978577052, now seen corresponding path program 1 times [2025-03-17 14:26:48,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:48,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872643299] [2025-03-17 14:26:48,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:48,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:48,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:26:48,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:26:48,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:48,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:48,078 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-17 14:26:48,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:48,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872643299] [2025-03-17 14:26:48,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872643299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:26:48,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153103367] [2025-03-17 14:26:48,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:48,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:26:48,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:26:48,081 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:26:48,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:26:48,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:26:48,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:26:48,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:48,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:48,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:26:48,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:26:48,193 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-17 14:26:48,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:26:48,231 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-17 14:26:48,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153103367] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:26:48,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:26:48,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2025-03-17 14:26:48,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672210639] [2025-03-17 14:26:48,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:26:48,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:26:48,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:48,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:26:48,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:26:48,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2025-03-17 14:26:48,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 198 flow. Second operand has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:48,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:48,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2025-03-17 14:26:48,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand