./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 e2fb8bed 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-?-e2fb8be-m [2025-03-09 01:22:53,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:22:53,983 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:22:53,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:22:53,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:22:54,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:22:54,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:22:54,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:22:54,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:22:54,009 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:22:54,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:22:54,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:22:54,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:22:54,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:22:54,009 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:22:54,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:22:54,010 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:22:54,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:22:54,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:22:54,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:22:54,010 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:22:54,010 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:22:54,010 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:22:54,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:22:54,010 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:22:54,010 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:22:54,010 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:22:54,010 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:22:54,010 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:22:54,010 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:22:54,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:22:54,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:22:54,010 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:22:54,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:22:54,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:22:54,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:22:54,011 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:22:54,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:22:54,011 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:22:54,011 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:22:54,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:22:54,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:22:54,011 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-09 01:22:54,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:22:54,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:22:54,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:22:54,246 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:22:54,246 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:22:54,247 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-09 01:22:55,361 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5841838b8/d566be23c485435c83e6028cddfb3f05/FLAG318ed7dca [2025-03-09 01:22:55,591 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:22:55,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c [2025-03-09 01:22:55,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5841838b8/d566be23c485435c83e6028cddfb3f05/FLAG318ed7dca [2025-03-09 01:22:55,937 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5841838b8/d566be23c485435c83e6028cddfb3f05 [2025-03-09 01:22:55,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:22:55,940 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:22:55,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:22:55,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:22:55,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:22:55,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:22:55" (1/1) ... [2025-03-09 01:22:55,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@473046f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:55, skipping insertion in model container [2025-03-09 01:22:55,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:22:55" (1/1) ... [2025-03-09 01:22:55,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:22:56,088 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-09 01:22:56,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:22:56,102 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:22:56,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:22:56,144 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:22:56,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:56 WrapperNode [2025-03-09 01:22:56,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:22:56,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:22:56,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:22:56,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:22:56,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:56" (1/1) ... [2025-03-09 01:22:56,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:56" (1/1) ... [2025-03-09 01:22:56,175 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 19, calls inlined = 25, statements flattened = 290 [2025-03-09 01:22:56,176 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:22:56,176 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:22:56,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:22:56,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:22:56,187 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:56" (1/1) ... [2025-03-09 01:22:56,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:56" (1/1) ... [2025-03-09 01:22:56,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:56" (1/1) ... [2025-03-09 01:22:56,211 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-09 01:22:56,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:56" (1/1) ... [2025-03-09 01:22:56,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:56" (1/1) ... [2025-03-09 01:22:56,220 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:56" (1/1) ... [2025-03-09 01:22:56,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:56" (1/1) ... [2025-03-09 01:22:56,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:56" (1/1) ... [2025-03-09 01:22:56,228 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:56" (1/1) ... [2025-03-09 01:22:56,230 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:22:56,231 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:22:56,231 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:22:56,231 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:22:56,232 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:56" (1/1) ... [2025-03-09 01:22:56,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:22:56,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:22:56,257 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-09 01:22:56,259 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-09 01:22:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:22:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:22:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:22:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:22:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:22:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:22:56,274 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:22:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:22:56,274 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:22:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:22:56,274 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:22:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-09 01:22:56,274 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-09 01:22:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:22:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:22:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:22:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:22:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:22:56,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:22:56,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:22:56,276 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:22:56,361 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:22:56,362 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:22:56,732 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:22:56,732 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:22:56,987 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:22:56,988 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:22:56,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:22:56 BoogieIcfgContainer [2025-03-09 01:22:56,988 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:22:56,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:22:56,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:22:56,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:22:56,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:22:55" (1/3) ... [2025-03-09 01:22:56,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be0586b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:22:56, skipping insertion in model container [2025-03-09 01:22:56,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:22:56" (2/3) ... [2025-03-09 01:22:56,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be0586b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:22:56, skipping insertion in model container [2025-03-09 01:22:56,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:22:56" (3/3) ... [2025-03-09 01:22:56,995 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1.wvr.c [2025-03-09 01:22:57,005 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:22:57,007 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-09 01:22:57,007 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:22:57,062 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-09 01:22:57,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 67 transitions, 162 flow [2025-03-09 01:22:57,116 INFO L124 PetriNetUnfolderBase]: 9/63 cut-off events. [2025-03-09 01:22:57,119 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:22:57,124 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 142 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-09 01:22:57,124 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 67 transitions, 162 flow [2025-03-09 01:22:57,126 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 62 transitions, 148 flow [2025-03-09 01:22:57,135 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:22:57,146 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;@5de04e5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:22:57,147 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-09 01:22:57,150 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:22:57,150 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:22:57,150 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:22:57,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:22:57,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:22:57,151 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:22:57,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:22:57,154 INFO L85 PathProgramCache]: Analyzing trace with hash 800397, now seen corresponding path program 1 times [2025-03-09 01:22:57,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:22:57,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483620318] [2025-03-09 01:22:57,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:22:57,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:22:57,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:22:57,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:22:57,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:22:57,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:22:57,357 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-09 01:22:57,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:22:57,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483620318] [2025-03-09 01:22:57,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483620318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:22:57,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:22:57,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:22:57,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510318910] [2025-03-09 01:22:57,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:22:57,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:22:57,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:22:57,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:22:57,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:22:57,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 67 [2025-03-09 01:22:57,392 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-09 01:22:57,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:22:57,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 67 [2025-03-09 01:22:57,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:00,988 INFO L124 PetriNetUnfolderBase]: 52563/68149 cut-off events. [2025-03-09 01:23:00,989 INFO L125 PetriNetUnfolderBase]: For 2987/2987 co-relation queries the response was YES. [2025-03-09 01:23:01,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138671 conditions, 68149 events. 52563/68149 cut-off events. For 2987/2987 co-relation queries the response was YES. Maximal size of possible extension queue 2733. Compared 380391 event pairs, 45952 based on Foata normal form. 1/48258 useless extension candidates. Maximal degree in co-relation 131473. Up to 68054 conditions per place. [2025-03-09 01:23:01,388 INFO L140 encePairwiseOnDemand]: 59/67 looper letters, 47 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-03-09 01:23:01,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 55 transitions, 232 flow [2025-03-09 01:23:01,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:23:01,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:23:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-03-09 01:23:01,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43781094527363185 [2025-03-09 01:23:01,403 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 148 flow. Second operand 3 states and 88 transitions. [2025-03-09 01:23:01,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 55 transitions, 232 flow [2025-03-09 01:23:01,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 216 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-09 01:23:01,519 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 122 flow [2025-03-09 01:23:01,520 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-09 01:23:01,523 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -9 predicate places. [2025-03-09 01:23:01,523 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 122 flow [2025-03-09 01:23:01,523 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-09 01:23:01,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:01,523 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:23:01,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:23:01,524 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:23:01,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:01,525 INFO L85 PathProgramCache]: Analyzing trace with hash 800398, now seen corresponding path program 1 times [2025-03-09 01:23:01,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:01,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337243338] [2025-03-09 01:23:01,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:01,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:01,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:23:01,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:23:01,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:01,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:01,809 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-09 01:23:01,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:01,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337243338] [2025-03-09 01:23:01,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337243338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:01,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:01,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:23:01,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143260824] [2025-03-09 01:23:01,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:01,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:23:01,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:01,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:23:01,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:23:01,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 67 [2025-03-09 01:23:01,819 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-09 01:23:01,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:01,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 67 [2025-03-09 01:23:01,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:04,342 INFO L124 PetriNetUnfolderBase]: 52564/68152 cut-off events. [2025-03-09 01:23:04,343 INFO L125 PetriNetUnfolderBase]: For 697/697 co-relation queries the response was YES. [2025-03-09 01:23:04,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137038 conditions, 68152 events. 52564/68152 cut-off events. For 697/697 co-relation queries the response was YES. Maximal size of possible extension queue 2733. Compared 380513 event pairs, 45952 based on Foata normal form. 0/48260 useless extension candidates. Maximal degree in co-relation 137016. Up to 68059 conditions per place. [2025-03-09 01:23:04,780 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 49 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-03-09 01:23:04,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 236 flow [2025-03-09 01:23:04,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:23:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:23:04,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-03-09 01:23:04,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3656716417910448 [2025-03-09 01:23:04,783 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 122 flow. Second operand 4 states and 98 transitions. [2025-03-09 01:23:04,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 236 flow [2025-03-09 01:23:04,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:04,786 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 145 flow [2025-03-09 01:23:04,786 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-09 01:23:04,787 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places. [2025-03-09 01:23:04,787 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 145 flow [2025-03-09 01:23:04,788 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-09 01:23:04,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:04,789 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:23:04,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:23:04,789 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:23:04,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:04,789 INFO L85 PathProgramCache]: Analyzing trace with hash 769207349, now seen corresponding path program 1 times [2025-03-09 01:23:04,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:04,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558154753] [2025-03-09 01:23:04,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:04,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:04,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:23:04,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:23:04,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:04,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:05,063 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-09 01:23:05,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:05,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558154753] [2025-03-09 01:23:05,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558154753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:23:05,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094438784] [2025-03-09 01:23:05,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:05,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:05,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:23:05,067 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-09 01:23:05,072 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-09 01:23:05,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:23:05,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:23:05,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:05,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:05,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:23:05,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:23:05,202 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-09 01:23:05,384 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-09 01:23:05,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:23:05,474 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-09 01:23:05,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094438784] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:23:05,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:23:05,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:23:05,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266221669] [2025-03-09 01:23:05,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:23:05,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:23:05,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:05,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:23:05,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:23:05,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 67 [2025-03-09 01:23:05,505 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-09 01:23:05,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:05,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 67 [2025-03-09 01:23:05,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:08,438 INFO L124 PetriNetUnfolderBase]: 52565/68154 cut-off events. [2025-03-09 01:23:08,438 INFO L125 PetriNetUnfolderBase]: For 697/697 co-relation queries the response was YES. [2025-03-09 01:23:08,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137054 conditions, 68154 events. 52565/68154 cut-off events. For 697/697 co-relation queries the response was YES. Maximal size of possible extension queue 2733. Compared 380488 event pairs, 45952 based on Foata normal form. 0/48261 useless extension candidates. Maximal degree in co-relation 137023. Up to 68056 conditions per place. [2025-03-09 01:23:08,702 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 45 selfloop transitions, 10 changer transitions 0/60 dead transitions. [2025-03-09 01:23:08,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 60 transitions, 263 flow [2025-03-09 01:23:08,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:23:08,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:23:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2025-03-09 01:23:08,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27052238805970147 [2025-03-09 01:23:08,707 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 145 flow. Second operand 8 states and 145 transitions. [2025-03-09 01:23:08,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 60 transitions, 263 flow [2025-03-09 01:23:08,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 60 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:23:08,708 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 170 flow [2025-03-09 01:23:08,708 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-09 01:23:08,709 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2025-03-09 01:23:08,709 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 170 flow [2025-03-09 01:23:08,709 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-09 01:23:08,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:08,709 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:08,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:23:08,910 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-09 01:23:08,910 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:23:08,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:08,910 INFO L85 PathProgramCache]: Analyzing trace with hash 548251106, now seen corresponding path program 1 times [2025-03-09 01:23:08,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:08,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830954579] [2025-03-09 01:23:08,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:08,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:09,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:23:09,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:23:09,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:09,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:09,071 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-09 01:23:09,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:09,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830954579] [2025-03-09 01:23:09,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830954579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:09,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:09,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:23:09,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404343515] [2025-03-09 01:23:09,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:09,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:23:09,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:09,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:23:09,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:23:09,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 67 [2025-03-09 01:23:09,077 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-09 01:23:09,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:09,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 67 [2025-03-09 01:23:09,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:10,917 INFO L124 PetriNetUnfolderBase]: 33317/43271 cut-off events. [2025-03-09 01:23:10,917 INFO L125 PetriNetUnfolderBase]: For 484/484 co-relation queries the response was YES. [2025-03-09 01:23:10,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87071 conditions, 43271 events. 33317/43271 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 1698. Compared 230150 event pairs, 28599 based on Foata normal form. 0/33783 useless extension candidates. Maximal degree in co-relation 87033. Up to 43182 conditions per place. [2025-03-09 01:23:11,073 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 47 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2025-03-09 01:23:11,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 264 flow [2025-03-09 01:23:11,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:23:11,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:23:11,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-03-09 01:23:11,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34701492537313433 [2025-03-09 01:23:11,074 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 170 flow. Second operand 4 states and 93 transitions. [2025-03-09 01:23:11,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 264 flow [2025-03-09 01:23:11,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 222 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-09 01:23:11,075 INFO L231 Difference]: Finished difference. Result has 57 places, 56 transitions, 128 flow [2025-03-09 01:23:11,076 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-09 01:23:11,077 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -9 predicate places. [2025-03-09 01:23:11,077 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 128 flow [2025-03-09 01:23:11,077 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-09 01:23:11,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:11,077 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:11,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:23:11,077 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:23:11,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:11,077 INFO L85 PathProgramCache]: Analyzing trace with hash 548251107, now seen corresponding path program 1 times [2025-03-09 01:23:11,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:11,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218965440] [2025-03-09 01:23:11,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:11,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:11,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:23:11,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:23:11,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:11,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:11,138 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-09 01:23:11,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:11,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218965440] [2025-03-09 01:23:11,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218965440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:11,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:11,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:23:11,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17929153] [2025-03-09 01:23:11,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:11,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:23:11,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:11,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:23:11,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:23:11,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2025-03-09 01:23:11,147 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-09 01:23:11,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:11,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2025-03-09 01:23:11,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:13,358 INFO L124 PetriNetUnfolderBase]: 45008/59019 cut-off events. [2025-03-09 01:23:13,358 INFO L125 PetriNetUnfolderBase]: For 748/748 co-relation queries the response was YES. [2025-03-09 01:23:13,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118678 conditions, 59019 events. 45008/59019 cut-off events. For 748/748 co-relation queries the response was YES. Maximal size of possible extension queue 2215. Compared 333126 event pairs, 39350 based on Foata normal form. 1507/47769 useless extension candidates. Maximal degree in co-relation 86609. Up to 42955 conditions per place. [2025-03-09 01:23:13,590 INFO L140 encePairwiseOnDemand]: 59/67 looper letters, 81 selfloop transitions, 3 changer transitions 1/90 dead transitions. [2025-03-09 01:23:13,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 90 transitions, 374 flow [2025-03-09 01:23:13,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:23:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:23:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-03-09 01:23:13,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.503731343283582 [2025-03-09 01:23:13,592 INFO L175 Difference]: Start difference. First operand has 57 places, 56 transitions, 128 flow. Second operand 4 states and 135 transitions. [2025-03-09 01:23:13,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 90 transitions, 374 flow [2025-03-09 01:23:13,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 90 transitions, 369 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:13,593 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 140 flow [2025-03-09 01:23:13,593 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-09 01:23:13,594 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -7 predicate places. [2025-03-09 01:23:13,594 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 140 flow [2025-03-09 01:23:13,594 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-09 01:23:13,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:13,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:13,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:23:13,595 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:23:13,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:13,595 INFO L85 PathProgramCache]: Analyzing trace with hash 237596682, now seen corresponding path program 1 times [2025-03-09 01:23:13,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:13,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956197001] [2025-03-09 01:23:13,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:13,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:13,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:23:13,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:23:13,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:13,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:13,690 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-09 01:23:13,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:13,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956197001] [2025-03-09 01:23:13,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956197001] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:23:13,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133937995] [2025-03-09 01:23:13,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:13,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:13,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:23:13,693 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-09 01:23:13,695 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-09 01:23:13,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:23:13,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:23:13,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:13,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:13,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:23:13,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:23:13,802 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-09 01:23:13,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:23:13,843 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-09 01:23:13,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133937995] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:23:13,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:23:13,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2025-03-09 01:23:13,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372401562] [2025-03-09 01:23:13,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:23:13,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:23:13,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:13,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:23:13,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:23:13,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2025-03-09 01:23:13,854 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-09 01:23:13,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:13,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2025-03-09 01:23:13,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:16,709 INFO L124 PetriNetUnfolderBase]: 56883/74953 cut-off events. [2025-03-09 01:23:16,709 INFO L125 PetriNetUnfolderBase]: For 4842/4842 co-relation queries the response was YES. [2025-03-09 01:23:16,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155468 conditions, 74953 events. 56883/74953 cut-off events. For 4842/4842 co-relation queries the response was YES. Maximal size of possible extension queue 2371. Compared 435590 event pairs, 50279 based on Foata normal form. 1506/60261 useless extension candidates. Maximal degree in co-relation 123410. Up to 42950 conditions per place. [2025-03-09 01:23:17,019 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 78 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2025-03-09 01:23:17,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 91 transitions, 392 flow [2025-03-09 01:23:17,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:23:17,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:23:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2025-03-09 01:23:17,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37100213219616207 [2025-03-09 01:23:17,021 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 140 flow. Second operand 7 states and 174 transitions. [2025-03-09 01:23:17,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 91 transitions, 392 flow [2025-03-09 01:23:17,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 91 transitions, 387 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:17,026 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 172 flow [2025-03-09 01:23:17,026 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-09 01:23:17,027 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2025-03-09 01:23:17,027 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 172 flow [2025-03-09 01:23:17,027 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-09 01:23:17,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:17,027 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:17,034 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-09 01:23:17,228 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-09 01:23:17,228 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:23:17,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:17,228 INFO L85 PathProgramCache]: Analyzing trace with hash 972768695, now seen corresponding path program 1 times [2025-03-09 01:23:17,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:17,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535154885] [2025-03-09 01:23:17,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:17,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:17,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:23:17,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:23:17,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:17,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:17,295 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-09 01:23:17,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:17,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535154885] [2025-03-09 01:23:17,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535154885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:17,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:17,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:23:17,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133367523] [2025-03-09 01:23:17,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:17,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:23:17,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:17,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:23:17,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:23:17,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2025-03-09 01:23:17,300 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-09 01:23:17,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:17,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2025-03-09 01:23:17,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:20,229 INFO L124 PetriNetUnfolderBase]: 49569/65352 cut-off events. [2025-03-09 01:23:20,230 INFO L125 PetriNetUnfolderBase]: For 7641/7641 co-relation queries the response was YES. [2025-03-09 01:23:20,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141002 conditions, 65352 events. 49569/65352 cut-off events. For 7641/7641 co-relation queries the response was YES. Maximal size of possible extension queue 2125. Compared 373998 event pairs, 43898 based on Foata normal form. 611/51920 useless extension candidates. Maximal degree in co-relation 96536. Up to 59025 conditions per place. [2025-03-09 01:23:20,446 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 49 selfloop transitions, 2 changer transitions 29/85 dead transitions. [2025-03-09 01:23:20,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 85 transitions, 396 flow [2025-03-09 01:23:20,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:23:20,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:23:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2025-03-09 01:23:20,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47761194029850745 [2025-03-09 01:23:20,447 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 172 flow. Second operand 4 states and 128 transitions. [2025-03-09 01:23:20,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 85 transitions, 396 flow [2025-03-09 01:23:20,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 85 transitions, 388 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:23:20,453 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 169 flow [2025-03-09 01:23:20,453 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-09 01:23:20,453 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2025-03-09 01:23:20,453 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 169 flow [2025-03-09 01:23:20,454 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-09 01:23:20,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:20,454 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:20,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:23:20,454 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:23:20,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:20,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1948562319, now seen corresponding path program 2 times [2025-03-09 01:23:20,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:20,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648094425] [2025-03-09 01:23:20,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:23:20,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:20,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 01:23:20,471 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:23:20,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:23:20,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:20,644 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-09 01:23:20,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:20,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648094425] [2025-03-09 01:23:20,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648094425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:23:20,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967260280] [2025-03-09 01:23:20,644 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:23:20,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:20,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:23:20,646 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-09 01:23:20,648 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-09 01:23:20,694 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 01:23:20,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:23:20,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:23:20,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:20,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:23:20,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:23:20,777 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-09 01:23:20,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:23:20,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-09 01:23:20,858 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-09 01:23:20,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967260280] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:23:20,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:23:20,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2025-03-09 01:23:20,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959926722] [2025-03-09 01:23:20,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:23:20,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:23:20,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:20,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:23:20,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:23:20,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2025-03-09 01:23:20,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 169 flow. Second operand has 13 states, 13 states have (on average 14.23076923076923) internal successors, (185), 13 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:20,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:20,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2025-03-09 01:23:20,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:24,718 INFO L124 PetriNetUnfolderBase]: 58410/76333 cut-off events. [2025-03-09 01:23:24,718 INFO L125 PetriNetUnfolderBase]: For 11522/11522 co-relation queries the response was YES. [2025-03-09 01:23:24,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174585 conditions, 76333 events. 58410/76333 cut-off events. For 11522/11522 co-relation queries the response was YES. Maximal size of possible extension queue 2502. Compared 450379 event pairs, 22963 based on Foata normal form. 0/60148 useless extension candidates. Maximal degree in co-relation 174569. Up to 44489 conditions per place. [2025-03-09 01:23:25,036 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 114 selfloop transitions, 7 changer transitions 0/126 dead transitions. [2025-03-09 01:23:25,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 126 transitions, 595 flow [2025-03-09 01:23:25,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:23:25,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:23:25,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 207 transitions. [2025-03-09 01:23:25,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44136460554371004 [2025-03-09 01:23:25,037 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 169 flow. Second operand 7 states and 207 transitions. [2025-03-09 01:23:25,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 126 transitions, 595 flow [2025-03-09 01:23:25,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 126 transitions, 585 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:25,055 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 198 flow [2025-03-09 01:23:25,055 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=7, PETRI_FLOW=198, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2025-03-09 01:23:25,056 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 3 predicate places. [2025-03-09 01:23:25,056 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 198 flow [2025-03-09 01:23:25,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.23076923076923) internal successors, (185), 13 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:25,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:25,056 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:25,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:23:25,257 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-09 01:23:25,257 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-09 01:23:25,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:25,257 INFO L85 PathProgramCache]: Analyzing trace with hash 312976478, now seen corresponding path program 1 times [2025-03-09 01:23:25,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:25,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236428543] [2025-03-09 01:23:25,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:25,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:25,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:23:25,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:23:25,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:25,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:25,339 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-09 01:23:25,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:25,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236428543] [2025-03-09 01:23:25,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236428543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:23:25,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873297231] [2025-03-09 01:23:25,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:25,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:23:25,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:23:25,342 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-09 01:23:25,343 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-09 01:23:25,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:23:25,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:23:25,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:25,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:25,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:23:25,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:23:25,460 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-09 01:23:25,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:23:25,496 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-09 01:23:25,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873297231] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:23:25,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:23:25,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2025-03-09 01:23:25,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728884609] [2025-03-09 01:23:25,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:23:25,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:23:25,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:25,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:23:25,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:23:25,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 67 [2025-03-09 01:23:25,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 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-09 01:23:25,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:25,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 67 [2025-03-09 01:23:25,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand