./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/popl20-more-vector-add.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 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:52:20,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:52:20,772 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:52:20,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:52:20,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:52:20,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:52:20,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:52:20,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:52:20,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:52:20,794 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:52:20,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:52:20,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:52:20,810 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:52:20,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:52:20,810 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:52:20,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:52:20,811 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:52:20,811 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:52:20,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:52:20,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:52:20,812 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:52:20,813 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:52:20,813 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:52:20,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:52:20,814 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:52:20,814 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:52:20,814 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:52:20,814 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:52:20,815 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:52:20,815 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:52:20,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:52:20,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:52:20,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:52:20,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:52:20,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:52:20,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:52:20,816 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:52:20,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:52:20,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:52:20,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:52:20,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:52:20,823 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:52:20,824 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 [2024-11-19 09:52:21,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:52:21,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:52:21,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:52:21,047 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:52:21,047 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:52:21,048 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2024-11-19 09:52:22,419 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:52:22,577 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:52:22,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2024-11-19 09:52:22,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f49d64255/5e232c0ad3c2419c971e0e1baab0a27e/FLAG6a08cf134 [2024-11-19 09:52:22,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f49d64255/5e232c0ad3c2419c971e0e1baab0a27e [2024-11-19 09:52:22,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:52:22,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:52:22,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:52:22,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:52:22,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:52:22,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:52:22" (1/1) ... [2024-11-19 09:52:22,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30fdb2ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:52:22, skipping insertion in model container [2024-11-19 09:52:22,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:52:22" (1/1) ... [2024-11-19 09:52:22,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:52:22,837 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:52:22,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:52:22,855 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:52:22,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:52:22,884 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:52:22,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:52:22 WrapperNode [2024-11-19 09:52:22,885 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:52:22,886 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:52:22,886 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:52:22,886 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:52:22,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:52:22" (1/1) ... [2024-11-19 09:52:22,900 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:52:22" (1/1) ... [2024-11-19 09:52:22,916 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 12, calls inlined = 18, statements flattened = 187 [2024-11-19 09:52:22,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:52:22,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:52:22,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:52:22,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:52:22,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:52:22" (1/1) ... [2024-11-19 09:52:22,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:52:22" (1/1) ... [2024-11-19 09:52:22,930 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:52:22" (1/1) ... [2024-11-19 09:52:22,941 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2024-11-19 09:52:22,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:52:22" (1/1) ... [2024-11-19 09:52:22,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:52:22" (1/1) ... [2024-11-19 09:52:22,952 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:52:22" (1/1) ... [2024-11-19 09:52:22,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:52:22" (1/1) ... [2024-11-19 09:52:22,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:52:22" (1/1) ... [2024-11-19 09:52:22,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:52:22" (1/1) ... [2024-11-19 09:52:22,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:52:22,961 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:52:22,961 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:52:22,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:52:22,962 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:52:22" (1/1) ... [2024-11-19 09:52:22,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:52:22,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:52:22,994 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) [2024-11-19 09:52:23,000 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 [2024-11-19 09:52:23,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:52:23,046 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 09:52:23,047 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 09:52:23,047 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 09:52:23,047 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 09:52:23,047 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 09:52:23,047 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 09:52:23,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:52:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 09:52:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 09:52:23,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 09:52:23,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:52:23,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:52:23,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:52:23,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 09:52:23,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 09:52:23,051 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:52:23,157 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:52:23,159 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:52:23,525 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:52:23,525 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:52:23,840 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:52:23,840 INFO L316 CfgBuilder]: Removed 7 assume(true) statements. [2024-11-19 09:52:23,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:52:23 BoogieIcfgContainer [2024-11-19 09:52:23,841 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:52:23,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:52:23,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:52:23,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:52:23,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:52:22" (1/3) ... [2024-11-19 09:52:23,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b92bfee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:52:23, skipping insertion in model container [2024-11-19 09:52:23,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:52:22" (2/3) ... [2024-11-19 09:52:23,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b92bfee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:52:23, skipping insertion in model container [2024-11-19 09:52:23,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:52:23" (3/3) ... [2024-11-19 09:52:23,846 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2024-11-19 09:52:23,859 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:52:23,859 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2024-11-19 09:52:23,859 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:52:23,917 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 09:52:23,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 80 transitions, 181 flow [2024-11-19 09:52:23,968 INFO L124 PetriNetUnfolderBase]: 7/77 cut-off events. [2024-11-19 09:52:23,969 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 09:52:23,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 77 events. 7/77 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 214 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2024-11-19 09:52:23,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 80 transitions, 181 flow [2024-11-19 09:52:23,975 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 76 transitions, 170 flow [2024-11-19 09:52:23,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:52:23,986 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;@739608a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:52:23,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2024-11-19 09:52:23,990 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:52:23,990 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-19 09:52:23,990 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:52:23,990 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:23,990 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:52:23,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:23,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:23,994 INFO L85 PathProgramCache]: Analyzing trace with hash 754811, now seen corresponding path program 1 times [2024-11-19 09:52:24,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:24,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470222031] [2024-11-19 09:52:24,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:24,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:52:24,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:24,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470222031] [2024-11-19 09:52:24,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470222031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:52:24,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:52:24,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:52:24,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189054930] [2024-11-19 09:52:24,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:52:24,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:52:24,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:24,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:52:24,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:52:24,324 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 80 [2024-11-19 09:52:24,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 76 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:52:24,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:24,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 80 [2024-11-19 09:52:24,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:24,452 INFO L124 PetriNetUnfolderBase]: 203/513 cut-off events. [2024-11-19 09:52:24,452 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-19 09:52:24,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 513 events. 203/513 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2754 event pairs, 124 based on Foata normal form. 1/377 useless extension candidates. Maximal degree in co-relation 732. Up to 294 conditions per place. [2024-11-19 09:52:24,464 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 31 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2024-11-19 09:52:24,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 70 transitions, 224 flow [2024-11-19 09:52:24,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:52:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:52:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2024-11-19 09:52:24,482 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6708333333333333 [2024-11-19 09:52:24,485 INFO L175 Difference]: Start difference. First operand has 79 places, 76 transitions, 170 flow. Second operand 3 states and 161 transitions. [2024-11-19 09:52:24,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 70 transitions, 224 flow [2024-11-19 09:52:24,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 70 transitions, 212 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 09:52:24,493 INFO L231 Difference]: Finished difference. Result has 69 places, 70 transitions, 150 flow [2024-11-19 09:52:24,495 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=69, PETRI_TRANSITIONS=70} [2024-11-19 09:52:24,500 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, -10 predicate places. [2024-11-19 09:52:24,500 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 150 flow [2024-11-19 09:52:24,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:52:24,501 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:24,501 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:52:24,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:52:24,501 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:24,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:24,503 INFO L85 PathProgramCache]: Analyzing trace with hash 754812, now seen corresponding path program 1 times [2024-11-19 09:52:24,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:24,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463604443] [2024-11-19 09:52:24,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:24,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:24,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:52:24,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:24,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463604443] [2024-11-19 09:52:24,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463604443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:52:24,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:52:24,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:52:24,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450732726] [2024-11-19 09:52:24,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:52:24,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:52:24,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:24,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:52:24,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:52:24,872 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 80 [2024-11-19 09:52:24,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 70 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 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) [2024-11-19 09:52:24,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:24,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 80 [2024-11-19 09:52:24,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:25,004 INFO L124 PetriNetUnfolderBase]: 203/512 cut-off events. [2024-11-19 09:52:25,005 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 09:52:25,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 512 events. 203/512 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2748 event pairs, 124 based on Foata normal form. 0/373 useless extension candidates. Maximal degree in co-relation 801. Up to 306 conditions per place. [2024-11-19 09:52:25,012 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 32 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2024-11-19 09:52:25,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 220 flow [2024-11-19 09:52:25,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:52:25,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:52:25,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2024-11-19 09:52:25,016 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.628125 [2024-11-19 09:52:25,016 INFO L175 Difference]: Start difference. First operand has 69 places, 70 transitions, 150 flow. Second operand 4 states and 201 transitions. [2024-11-19 09:52:25,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 220 flow [2024-11-19 09:52:25,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:52:25,018 INFO L231 Difference]: Finished difference. Result has 69 places, 69 transitions, 152 flow [2024-11-19 09:52:25,018 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=69, PETRI_TRANSITIONS=69} [2024-11-19 09:52:25,019 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, -10 predicate places. [2024-11-19 09:52:25,019 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 152 flow [2024-11-19 09:52:25,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 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) [2024-11-19 09:52:25,019 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:25,019 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-19 09:52:25,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:52:25,020 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:25,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:25,020 INFO L85 PathProgramCache]: Analyzing trace with hash 23402669, now seen corresponding path program 1 times [2024-11-19 09:52:25,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:25,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924410661] [2024-11-19 09:52:25,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:25,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:25,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:52:25,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:25,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924410661] [2024-11-19 09:52:25,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924410661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:52:25,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:52:25,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:52:25,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668052671] [2024-11-19 09:52:25,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:52:25,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:52:25,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:25,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:52:25,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:52:25,127 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 80 [2024-11-19 09:52:25,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:52:25,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:25,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 80 [2024-11-19 09:52:25,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:25,304 INFO L124 PetriNetUnfolderBase]: 207/530 cut-off events. [2024-11-19 09:52:25,304 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 09:52:25,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 530 events. 207/530 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2868 event pairs, 124 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 807. Up to 308 conditions per place. [2024-11-19 09:52:25,312 INFO L140 encePairwiseOnDemand]: 68/80 looper letters, 35 selfloop transitions, 13 changer transitions 0/84 dead transitions. [2024-11-19 09:52:25,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 84 transitions, 284 flow [2024-11-19 09:52:25,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:52:25,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:52:25,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2024-11-19 09:52:25,314 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.721875 [2024-11-19 09:52:25,314 INFO L175 Difference]: Start difference. First operand has 69 places, 69 transitions, 152 flow. Second operand 4 states and 231 transitions. [2024-11-19 09:52:25,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 84 transitions, 284 flow [2024-11-19 09:52:25,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 84 transitions, 270 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:52:25,322 INFO L231 Difference]: Finished difference. Result has 71 places, 80 transitions, 228 flow [2024-11-19 09:52:25,322 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=71, PETRI_TRANSITIONS=80} [2024-11-19 09:52:25,323 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, -8 predicate places. [2024-11-19 09:52:25,324 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 80 transitions, 228 flow [2024-11-19 09:52:25,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:52:25,324 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:25,324 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:52:25,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:52:25,325 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:25,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:25,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1012529321, now seen corresponding path program 1 times [2024-11-19 09:52:25,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:25,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006107607] [2024-11-19 09:52:25,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:25,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:25,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:52:25,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:25,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006107607] [2024-11-19 09:52:25,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006107607] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:52:25,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207098098] [2024-11-19 09:52:25,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:25,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:52:25,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:52:25,512 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) [2024-11-19 09:52:25,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 09:52:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:25,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 09:52:25,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:52:25,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 09:52:25,732 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 09:52:25,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2024-11-19 09:52:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:52:25,757 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:52:25,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:52:25,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207098098] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 09:52:25,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:52:25,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 10 [2024-11-19 09:52:25,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435186684] [2024-11-19 09:52:25,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:52:25,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:52:25,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:25,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:52:25,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:52:25,928 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 80 [2024-11-19 09:52:25,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 80 transitions, 228 flow. Second operand has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 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) [2024-11-19 09:52:25,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:25,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 80 [2024-11-19 09:52:25,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:26,162 INFO L124 PetriNetUnfolderBase]: 405/1025 cut-off events. [2024-11-19 09:52:26,162 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-19 09:52:26,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1711 conditions, 1025 events. 405/1025 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6558 event pairs, 248 based on Foata normal form. 3/770 useless extension candidates. Maximal degree in co-relation 811. Up to 310 conditions per place. [2024-11-19 09:52:26,168 INFO L140 encePairwiseOnDemand]: 68/80 looper letters, 62 selfloop transitions, 11 changer transitions 0/106 dead transitions. [2024-11-19 09:52:26,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 106 transitions, 443 flow [2024-11-19 09:52:26,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:52:26,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:52:26,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 279 transitions. [2024-11-19 09:52:26,170 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6975 [2024-11-19 09:52:26,170 INFO L175 Difference]: Start difference. First operand has 71 places, 80 transitions, 228 flow. Second operand 5 states and 279 transitions. [2024-11-19 09:52:26,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 106 transitions, 443 flow [2024-11-19 09:52:26,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 106 transitions, 443 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 09:52:26,173 INFO L231 Difference]: Finished difference. Result has 76 places, 81 transitions, 269 flow [2024-11-19 09:52:26,173 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=76, PETRI_TRANSITIONS=81} [2024-11-19 09:52:26,173 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, -3 predicate places. [2024-11-19 09:52:26,174 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 81 transitions, 269 flow [2024-11-19 09:52:26,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 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) [2024-11-19 09:52:26,174 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:26,174 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-19 09:52:26,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 09:52:26,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:52:26,375 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:26,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:26,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1916873328, now seen corresponding path program 1 times [2024-11-19 09:52:26,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:26,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002544136] [2024-11-19 09:52:26,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:26,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:52:26,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:26,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002544136] [2024-11-19 09:52:26,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002544136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:52:26,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180425982] [2024-11-19 09:52:26,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:26,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:52:26,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:52:26,467 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) [2024-11-19 09:52:26,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 09:52:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:26,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:52:26,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:52:26,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:52:26,587 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:52:26,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:52:26,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180425982] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:52:26,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:52:26,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-19 09:52:26,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046179364] [2024-11-19 09:52:26,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:52:26,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:52:26,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:26,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:52:26,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:52:26,745 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 80 [2024-11-19 09:52:26,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 81 transitions, 269 flow. Second operand has 13 states, 13 states have (on average 46.53846153846154) internal successors, (605), 13 states have internal predecessors, (605), 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) [2024-11-19 09:52:26,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:26,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 80 [2024-11-19 09:52:26,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:27,093 INFO L124 PetriNetUnfolderBase]: 610/1548 cut-off events. [2024-11-19 09:52:27,094 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-19 09:52:27,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2626 conditions, 1548 events. 610/1548 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9505 event pairs, 372 based on Foata normal form. 3/1160 useless extension candidates. Maximal degree in co-relation 837. Up to 590 conditions per place. [2024-11-19 09:52:27,102 INFO L140 encePairwiseOnDemand]: 67/80 looper letters, 54 selfloop transitions, 39 changer transitions 0/129 dead transitions. [2024-11-19 09:52:27,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 129 transitions, 649 flow [2024-11-19 09:52:27,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:52:27,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:52:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 500 transitions. [2024-11-19 09:52:27,103 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2024-11-19 09:52:27,103 INFO L175 Difference]: Start difference. First operand has 76 places, 81 transitions, 269 flow. Second operand 9 states and 500 transitions. [2024-11-19 09:52:27,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 129 transitions, 649 flow [2024-11-19 09:52:27,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 129 transitions, 647 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:52:27,107 INFO L231 Difference]: Finished difference. Result has 85 places, 102 transitions, 505 flow [2024-11-19 09:52:27,107 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=505, PETRI_PLACES=85, PETRI_TRANSITIONS=102} [2024-11-19 09:52:27,107 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 6 predicate places. [2024-11-19 09:52:27,107 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 102 transitions, 505 flow [2024-11-19 09:52:27,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.53846153846154) internal successors, (605), 13 states have internal predecessors, (605), 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) [2024-11-19 09:52:27,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:27,108 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:52:27,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 09:52:27,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:52:27,313 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:27,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:27,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1268851006, now seen corresponding path program 1 times [2024-11-19 09:52:27,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:27,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641006255] [2024-11-19 09:52:27,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:27,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:27,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:52:27,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:27,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641006255] [2024-11-19 09:52:27,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641006255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:52:27,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:52:27,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:52:27,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167566552] [2024-11-19 09:52:27,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:52:27,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:52:27,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:27,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:52:27,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:52:27,406 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2024-11-19 09:52:27,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 102 transitions, 505 flow. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 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) [2024-11-19 09:52:27,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:27,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2024-11-19 09:52:27,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:27,660 INFO L124 PetriNetUnfolderBase]: 874/2142 cut-off events. [2024-11-19 09:52:27,660 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-11-19 09:52:27,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3718 conditions, 2142 events. 874/2142 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 13466 event pairs, 496 based on Foata normal form. 2/1588 useless extension candidates. Maximal degree in co-relation 1411. Up to 781 conditions per place. [2024-11-19 09:52:27,684 INFO L140 encePairwiseOnDemand]: 67/80 looper letters, 71 selfloop transitions, 27 changer transitions 1/134 dead transitions. [2024-11-19 09:52:27,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 134 transitions, 795 flow [2024-11-19 09:52:27,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:52:27,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:52:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 343 transitions. [2024-11-19 09:52:27,685 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7145833333333333 [2024-11-19 09:52:27,685 INFO L175 Difference]: Start difference. First operand has 85 places, 102 transitions, 505 flow. Second operand 6 states and 343 transitions. [2024-11-19 09:52:27,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 134 transitions, 795 flow [2024-11-19 09:52:27,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 134 transitions, 694 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-11-19 09:52:27,695 INFO L231 Difference]: Finished difference. Result has 88 places, 104 transitions, 478 flow [2024-11-19 09:52:27,696 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=478, PETRI_PLACES=88, PETRI_TRANSITIONS=104} [2024-11-19 09:52:27,696 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 9 predicate places. [2024-11-19 09:52:27,696 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 104 transitions, 478 flow [2024-11-19 09:52:27,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 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) [2024-11-19 09:52:27,696 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:27,696 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2024-11-19 09:52:27,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:52:27,697 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:27,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:27,697 INFO L85 PathProgramCache]: Analyzing trace with hash -2096408692, now seen corresponding path program 2 times [2024-11-19 09:52:27,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:27,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190348466] [2024-11-19 09:52:27,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:52:27,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:27,737 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:52:27,737 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:52:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 09:52:27,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:27,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190348466] [2024-11-19 09:52:27,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190348466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:52:27,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750520553] [2024-11-19 09:52:27,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:52:27,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:52:27,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:52:27,984 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) [2024-11-19 09:52:27,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 09:52:28,041 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:52:28,041 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:52:28,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 09:52:28,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:52:28,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 09:52:28,149 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 09:52:28,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2024-11-19 09:52:28,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:52:28,202 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:52:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:52:28,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750520553] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:52:28,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:52:28,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2024-11-19 09:52:28,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867933418] [2024-11-19 09:52:28,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:52:28,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 09:52:28,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:28,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 09:52:28,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-11-19 09:52:29,436 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 80 [2024-11-19 09:52:29,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 104 transitions, 478 flow. Second operand has 16 states, 16 states have (on average 42.75) internal successors, (684), 16 states have internal predecessors, (684), 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) [2024-11-19 09:52:29,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:29,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 80 [2024-11-19 09:52:29,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:30,251 INFO L124 PetriNetUnfolderBase]: 750/2054 cut-off events. [2024-11-19 09:52:30,251 INFO L125 PetriNetUnfolderBase]: For 441/465 co-relation queries the response was YES. [2024-11-19 09:52:30,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3740 conditions, 2054 events. 750/2054 cut-off events. For 441/465 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 14270 event pairs, 496 based on Foata normal form. 12/1503 useless extension candidates. Maximal degree in co-relation 1735. Up to 825 conditions per place. [2024-11-19 09:52:30,262 INFO L140 encePairwiseOnDemand]: 64/80 looper letters, 50 selfloop transitions, 39 changer transitions 0/122 dead transitions. [2024-11-19 09:52:30,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 122 transitions, 702 flow [2024-11-19 09:52:30,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:52:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:52:30,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 549 transitions. [2024-11-19 09:52:30,263 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6238636363636364 [2024-11-19 09:52:30,264 INFO L175 Difference]: Start difference. First operand has 88 places, 104 transitions, 478 flow. Second operand 11 states and 549 transitions. [2024-11-19 09:52:30,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 122 transitions, 702 flow [2024-11-19 09:52:30,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 122 transitions, 651 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:52:30,267 INFO L231 Difference]: Finished difference. Result has 92 places, 99 transitions, 493 flow [2024-11-19 09:52:30,267 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=493, PETRI_PLACES=92, PETRI_TRANSITIONS=99} [2024-11-19 09:52:30,267 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 13 predicate places. [2024-11-19 09:52:30,268 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 99 transitions, 493 flow [2024-11-19 09:52:30,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 42.75) internal successors, (684), 16 states have internal predecessors, (684), 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) [2024-11-19 09:52:30,268 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:30,268 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:52:30,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 09:52:30,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:52:30,473 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:30,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:30,474 INFO L85 PathProgramCache]: Analyzing trace with hash 368255388, now seen corresponding path program 1 times [2024-11-19 09:52:30,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:30,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984084053] [2024-11-19 09:52:30,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:30,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:52:30,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:30,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984084053] [2024-11-19 09:52:30,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984084053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:52:30,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:52:30,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:52:30,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237761287] [2024-11-19 09:52:30,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:52:30,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:52:30,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:30,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:52:30,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:52:30,653 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2024-11-19 09:52:30,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 99 transitions, 493 flow. Second operand has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:52:30,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:30,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2024-11-19 09:52:30,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:31,240 INFO L124 PetriNetUnfolderBase]: 822/2078 cut-off events. [2024-11-19 09:52:31,240 INFO L125 PetriNetUnfolderBase]: For 510/572 co-relation queries the response was YES. [2024-11-19 09:52:31,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3932 conditions, 2078 events. 822/2078 cut-off events. For 510/572 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 13545 event pairs, 496 based on Foata normal form. 0/1527 useless extension candidates. Maximal degree in co-relation 1743. Up to 790 conditions per place. [2024-11-19 09:52:31,255 INFO L140 encePairwiseOnDemand]: 68/80 looper letters, 68 selfloop transitions, 22 changer transitions 3/125 dead transitions. [2024-11-19 09:52:31,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 125 transitions, 771 flow [2024-11-19 09:52:31,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:52:31,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:52:31,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 339 transitions. [2024-11-19 09:52:31,260 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.70625 [2024-11-19 09:52:31,260 INFO L175 Difference]: Start difference. First operand has 92 places, 99 transitions, 493 flow. Second operand 6 states and 339 transitions. [2024-11-19 09:52:31,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 125 transitions, 771 flow [2024-11-19 09:52:31,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 125 transitions, 698 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-11-19 09:52:31,263 INFO L231 Difference]: Finished difference. Result has 94 places, 101 transitions, 481 flow [2024-11-19 09:52:31,263 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=481, PETRI_PLACES=94, PETRI_TRANSITIONS=101} [2024-11-19 09:52:31,271 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 15 predicate places. [2024-11-19 09:52:31,271 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 101 transitions, 481 flow [2024-11-19 09:52:31,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:52:31,271 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:31,271 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:52:31,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 09:52:31,271 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:31,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:31,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1690234398, now seen corresponding path program 1 times [2024-11-19 09:52:31,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:31,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768498160] [2024-11-19 09:52:31,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:31,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:31,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:52:31,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:31,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768498160] [2024-11-19 09:52:31,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768498160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:52:31,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:52:31,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:52:31,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142787689] [2024-11-19 09:52:31,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:52:31,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:52:31,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:31,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:52:31,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:52:31,481 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2024-11-19 09:52:31,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 101 transitions, 481 flow. Second operand has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 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) [2024-11-19 09:52:31,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:31,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2024-11-19 09:52:31,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:31,697 INFO L124 PetriNetUnfolderBase]: 633/1385 cut-off events. [2024-11-19 09:52:31,697 INFO L125 PetriNetUnfolderBase]: For 644/758 co-relation queries the response was YES. [2024-11-19 09:52:31,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3048 conditions, 1385 events. 633/1385 cut-off events. For 644/758 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 7193 event pairs, 411 based on Foata normal form. 0/1062 useless extension candidates. Maximal degree in co-relation 1838. Up to 758 conditions per place. [2024-11-19 09:52:31,705 INFO L140 encePairwiseOnDemand]: 68/80 looper letters, 46 selfloop transitions, 14 changer transitions 30/122 dead transitions. [2024-11-19 09:52:31,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 122 transitions, 751 flow [2024-11-19 09:52:31,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:52:31,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:52:31,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 336 transitions. [2024-11-19 09:52:31,706 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-11-19 09:52:31,707 INFO L175 Difference]: Start difference. First operand has 94 places, 101 transitions, 481 flow. Second operand 6 states and 336 transitions. [2024-11-19 09:52:31,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 122 transitions, 751 flow [2024-11-19 09:52:31,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 122 transitions, 714 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:52:31,710 INFO L231 Difference]: Finished difference. Result has 98 places, 89 transitions, 394 flow [2024-11-19 09:52:31,710 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=394, PETRI_PLACES=98, PETRI_TRANSITIONS=89} [2024-11-19 09:52:31,712 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 19 predicate places. [2024-11-19 09:52:31,712 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 89 transitions, 394 flow [2024-11-19 09:52:31,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 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) [2024-11-19 09:52:31,712 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:31,712 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:52:31,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:52:31,713 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:31,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:31,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1778551803, now seen corresponding path program 1 times [2024-11-19 09:52:31,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:31,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938125023] [2024-11-19 09:52:31,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:31,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:31,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:31,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:31,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938125023] [2024-11-19 09:52:31,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938125023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:52:31,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:52:31,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:52:31,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23392503] [2024-11-19 09:52:31,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:52:31,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:52:31,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:31,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:52:31,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:52:32,048 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 80 [2024-11-19 09:52:32,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 394 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 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) [2024-11-19 09:52:32,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:32,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 80 [2024-11-19 09:52:32,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:32,235 INFO L124 PetriNetUnfolderBase]: 862/1823 cut-off events. [2024-11-19 09:52:32,235 INFO L125 PetriNetUnfolderBase]: For 470/630 co-relation queries the response was YES. [2024-11-19 09:52:32,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3833 conditions, 1823 events. 862/1823 cut-off events. For 470/630 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 11078 event pairs, 612 based on Foata normal form. 0/1560 useless extension candidates. Maximal degree in co-relation 1917. Up to 1242 conditions per place. [2024-11-19 09:52:32,245 INFO L140 encePairwiseOnDemand]: 74/80 looper letters, 54 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2024-11-19 09:52:32,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 86 transitions, 506 flow [2024-11-19 09:52:32,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:52:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:52:32,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2024-11-19 09:52:32,246 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.535 [2024-11-19 09:52:32,246 INFO L175 Difference]: Start difference. First operand has 98 places, 89 transitions, 394 flow. Second operand 5 states and 214 transitions. [2024-11-19 09:52:32,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 86 transitions, 506 flow [2024-11-19 09:52:32,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 86 transitions, 432 flow, removed 13 selfloop flow, removed 11 redundant places. [2024-11-19 09:52:32,251 INFO L231 Difference]: Finished difference. Result has 80 places, 86 transitions, 324 flow [2024-11-19 09:52:32,251 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=80, PETRI_TRANSITIONS=86} [2024-11-19 09:52:32,252 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 1 predicate places. [2024-11-19 09:52:32,252 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 86 transitions, 324 flow [2024-11-19 09:52:32,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 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) [2024-11-19 09:52:32,256 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:32,256 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:52:32,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:52:32,256 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:32,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:32,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1778551802, now seen corresponding path program 1 times [2024-11-19 09:52:32,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:32,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053405147] [2024-11-19 09:52:32,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:32,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:32,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:52:32,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:32,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053405147] [2024-11-19 09:52:32,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053405147] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:52:32,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467377459] [2024-11-19 09:52:32,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:32,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:52:32,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:52:32,601 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) [2024-11-19 09:52:32,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 09:52:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:32,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-19 09:52:32,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:52:32,689 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 [2024-11-19 09:52:32,723 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 09:52:32,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2024-11-19 09:52:32,804 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-19 09:52:32,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 37 [2024-11-19 09:52:32,868 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-11-19 09:52:32,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 31 [2024-11-19 09:52:33,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:33,013 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:52:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:33,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467377459] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 09:52:33,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:52:33,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 16 [2024-11-19 09:52:33,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157797368] [2024-11-19 09:52:33,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:52:33,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:52:33,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:33,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:52:33,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-11-19 09:52:33,531 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2024-11-19 09:52:33,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 86 transitions, 324 flow. Second operand has 7 states, 7 states have (on average 45.285714285714285) internal successors, (317), 7 states have internal predecessors, (317), 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) [2024-11-19 09:52:33,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:33,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2024-11-19 09:52:33,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:34,004 INFO L124 PetriNetUnfolderBase]: 808/1959 cut-off events. [2024-11-19 09:52:34,004 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-19 09:52:34,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3281 conditions, 1959 events. 808/1959 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 13075 event pairs, 338 based on Foata normal form. 0/1459 useless extension candidates. Maximal degree in co-relation 1613. Up to 756 conditions per place. [2024-11-19 09:52:34,012 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 61 selfloop transitions, 11 changer transitions 0/100 dead transitions. [2024-11-19 09:52:34,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 100 transitions, 504 flow [2024-11-19 09:52:34,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:52:34,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:52:34,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 352 transitions. [2024-11-19 09:52:34,013 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2024-11-19 09:52:34,013 INFO L175 Difference]: Start difference. First operand has 80 places, 86 transitions, 324 flow. Second operand 7 states and 352 transitions. [2024-11-19 09:52:34,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 100 transitions, 504 flow [2024-11-19 09:52:34,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 100 transitions, 496 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:52:34,015 INFO L231 Difference]: Finished difference. Result has 85 places, 88 transitions, 358 flow [2024-11-19 09:52:34,016 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=358, PETRI_PLACES=85, PETRI_TRANSITIONS=88} [2024-11-19 09:52:34,016 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 6 predicate places. [2024-11-19 09:52:34,016 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 88 transitions, 358 flow [2024-11-19 09:52:34,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.285714285714285) internal successors, (317), 7 states have internal predecessors, (317), 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) [2024-11-19 09:52:34,016 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:34,017 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:52:34,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 09:52:34,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:52:34,221 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:34,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:34,221 INFO L85 PathProgramCache]: Analyzing trace with hash 699469704, now seen corresponding path program 1 times [2024-11-19 09:52:34,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:34,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667387893] [2024-11-19 09:52:34,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:34,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:34,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:52:34,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:34,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667387893] [2024-11-19 09:52:34,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667387893] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:52:34,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810171422] [2024-11-19 09:52:34,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:34,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:52:34,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:52:34,521 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:52:34,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 09:52:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:34,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-19 09:52:34,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:52:34,600 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 [2024-11-19 09:52:34,643 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 09:52:34,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2024-11-19 09:52:34,713 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-11-19 09:52:34,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 31 [2024-11-19 09:52:34,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:34,867 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:52:35,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:35,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810171422] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 09:52:35,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:52:35,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 16 [2024-11-19 09:52:35,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512583301] [2024-11-19 09:52:35,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:52:35,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:52:35,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:35,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:52:35,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-19 09:52:35,402 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2024-11-19 09:52:35,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 88 transitions, 358 flow. Second operand has 7 states, 7 states have (on average 45.285714285714285) internal successors, (317), 7 states have internal predecessors, (317), 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) [2024-11-19 09:52:35,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:35,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2024-11-19 09:52:35,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:35,781 INFO L124 PetriNetUnfolderBase]: 808/1921 cut-off events. [2024-11-19 09:52:35,782 INFO L125 PetriNetUnfolderBase]: For 293/377 co-relation queries the response was YES. [2024-11-19 09:52:35,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3677 conditions, 1921 events. 808/1921 cut-off events. For 293/377 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 12620 event pairs, 338 based on Foata normal form. 42/1577 useless extension candidates. Maximal degree in co-relation 1810. Up to 756 conditions per place. [2024-11-19 09:52:35,790 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 61 selfloop transitions, 10 changer transitions 0/100 dead transitions. [2024-11-19 09:52:35,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 100 transitions, 526 flow [2024-11-19 09:52:35,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:52:35,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:52:35,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 352 transitions. [2024-11-19 09:52:35,792 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2024-11-19 09:52:35,792 INFO L175 Difference]: Start difference. First operand has 85 places, 88 transitions, 358 flow. Second operand 7 states and 352 transitions. [2024-11-19 09:52:35,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 100 transitions, 526 flow [2024-11-19 09:52:35,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 100 transitions, 518 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:52:35,797 INFO L231 Difference]: Finished difference. Result has 90 places, 89 transitions, 386 flow [2024-11-19 09:52:35,798 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=386, PETRI_PLACES=90, PETRI_TRANSITIONS=89} [2024-11-19 09:52:35,798 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 11 predicate places. [2024-11-19 09:52:35,798 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 89 transitions, 386 flow [2024-11-19 09:52:35,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.285714285714285) internal successors, (317), 7 states have internal predecessors, (317), 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) [2024-11-19 09:52:35,799 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:35,799 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:52:35,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 09:52:36,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-19 09:52:36,003 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:36,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:36,003 INFO L85 PathProgramCache]: Analyzing trace with hash 699469703, now seen corresponding path program 1 times [2024-11-19 09:52:36,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:36,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317680842] [2024-11-19 09:52:36,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:36,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:36,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:36,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317680842] [2024-11-19 09:52:36,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317680842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:52:36,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:52:36,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:52:36,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885817783] [2024-11-19 09:52:36,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:52:36,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:52:36,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:36,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:52:36,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:52:36,250 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 80 [2024-11-19 09:52:36,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 386 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 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) [2024-11-19 09:52:36,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:36,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 80 [2024-11-19 09:52:36,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:36,448 INFO L124 PetriNetUnfolderBase]: 1142/2375 cut-off events. [2024-11-19 09:52:36,448 INFO L125 PetriNetUnfolderBase]: For 2992/3066 co-relation queries the response was YES. [2024-11-19 09:52:36,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5788 conditions, 2375 events. 1142/2375 cut-off events. For 2992/3066 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 15320 event pairs, 772 based on Foata normal form. 146/2299 useless extension candidates. Maximal degree in co-relation 2865. Up to 1606 conditions per place. [2024-11-19 09:52:36,461 INFO L140 encePairwiseOnDemand]: 74/80 looper letters, 56 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2024-11-19 09:52:36,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 86 transitions, 502 flow [2024-11-19 09:52:36,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:52:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:52:36,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2024-11-19 09:52:36,462 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.535 [2024-11-19 09:52:36,462 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 386 flow. Second operand 5 states and 214 transitions. [2024-11-19 09:52:36,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 86 transitions, 502 flow [2024-11-19 09:52:36,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 86 transitions, 488 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 09:52:36,464 INFO L231 Difference]: Finished difference. Result has 86 places, 86 transitions, 376 flow [2024-11-19 09:52:36,464 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=376, PETRI_PLACES=86, PETRI_TRANSITIONS=86} [2024-11-19 09:52:36,465 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 7 predicate places. [2024-11-19 09:52:36,465 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 86 transitions, 376 flow [2024-11-19 09:52:36,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 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) [2024-11-19 09:52:36,465 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:36,465 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:52:36,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 09:52:36,466 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:36,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:36,466 INFO L85 PathProgramCache]: Analyzing trace with hash 172061216, now seen corresponding path program 1 times [2024-11-19 09:52:36,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:36,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170337837] [2024-11-19 09:52:36,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:36,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:36,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:52:36,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:36,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170337837] [2024-11-19 09:52:36,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170337837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:52:36,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418575714] [2024-11-19 09:52:36,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:36,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:52:36,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:52:36,801 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:52:36,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 09:52:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:36,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-19 09:52:36,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:52:36,881 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 [2024-11-19 09:52:36,912 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 09:52:36,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2024-11-19 09:52:36,997 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-19 09:52:36,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 37 [2024-11-19 09:52:37,063 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-11-19 09:52:37,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 31 [2024-11-19 09:52:37,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:37,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:52:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:37,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418575714] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 09:52:37,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:52:37,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 16 [2024-11-19 09:52:37,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252133587] [2024-11-19 09:52:37,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:52:37,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:52:37,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:37,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:52:37,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-11-19 09:52:37,782 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2024-11-19 09:52:37,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 86 transitions, 376 flow. Second operand has 7 states, 7 states have (on average 45.57142857142857) internal successors, (319), 7 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:52:37,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:37,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2024-11-19 09:52:37,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:38,141 INFO L124 PetriNetUnfolderBase]: 1086/2423 cut-off events. [2024-11-19 09:52:38,141 INFO L125 PetriNetUnfolderBase]: For 2707/3307 co-relation queries the response was YES. [2024-11-19 09:52:38,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5373 conditions, 2423 events. 1086/2423 cut-off events. For 2707/3307 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 16752 event pairs, 468 based on Foata normal form. 0/1963 useless extension candidates. Maximal degree in co-relation 2657. Up to 990 conditions per place. [2024-11-19 09:52:38,151 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 62 selfloop transitions, 11 changer transitions 0/100 dead transitions. [2024-11-19 09:52:38,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 100 transitions, 581 flow [2024-11-19 09:52:38,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:52:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:52:38,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 351 transitions. [2024-11-19 09:52:38,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6267857142857143 [2024-11-19 09:52:38,153 INFO L175 Difference]: Start difference. First operand has 86 places, 86 transitions, 376 flow. Second operand 7 states and 351 transitions. [2024-11-19 09:52:38,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 100 transitions, 581 flow [2024-11-19 09:52:38,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 100 transitions, 573 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:52:38,155 INFO L231 Difference]: Finished difference. Result has 91 places, 88 transitions, 410 flow [2024-11-19 09:52:38,155 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=410, PETRI_PLACES=91, PETRI_TRANSITIONS=88} [2024-11-19 09:52:38,156 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 12 predicate places. [2024-11-19 09:52:38,156 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 410 flow [2024-11-19 09:52:38,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.57142857142857) internal successors, (319), 7 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:52:38,156 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:38,157 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:52:38,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 09:52:38,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:52:38,358 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:38,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:38,358 INFO L85 PathProgramCache]: Analyzing trace with hash 208725064, now seen corresponding path program 1 times [2024-11-19 09:52:38,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:38,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800471660] [2024-11-19 09:52:38,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:38,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:38,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:38,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:38,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800471660] [2024-11-19 09:52:38,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800471660] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:52:38,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816378089] [2024-11-19 09:52:38,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:38,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:52:38,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:52:38,551 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:52:38,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 09:52:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:38,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-19 09:52:38,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:52:38,646 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 [2024-11-19 09:52:38,727 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 09:52:38,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2024-11-19 09:52:38,789 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-11-19 09:52:38,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 31 [2024-11-19 09:52:38,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:38,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:52:39,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:39,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816378089] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 09:52:39,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:52:39,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 15 [2024-11-19 09:52:39,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553960988] [2024-11-19 09:52:39,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:52:39,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:52:39,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:39,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:52:39,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-11-19 09:52:39,324 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2024-11-19 09:52:39,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 88 transitions, 410 flow. Second operand has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 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) [2024-11-19 09:52:39,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:39,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2024-11-19 09:52:39,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:39,594 INFO L124 PetriNetUnfolderBase]: 982/2325 cut-off events. [2024-11-19 09:52:39,594 INFO L125 PetriNetUnfolderBase]: For 2576/2926 co-relation queries the response was YES. [2024-11-19 09:52:39,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5921 conditions, 2325 events. 982/2325 cut-off events. For 2576/2926 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 16268 event pairs, 414 based on Foata normal form. 158/2119 useless extension candidates. Maximal degree in co-relation 2930. Up to 1112 conditions per place. [2024-11-19 09:52:39,607 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 61 selfloop transitions, 11 changer transitions 0/101 dead transitions. [2024-11-19 09:52:39,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 101 transitions, 603 flow [2024-11-19 09:52:39,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:52:39,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:52:39,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 402 transitions. [2024-11-19 09:52:39,609 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.628125 [2024-11-19 09:52:39,610 INFO L175 Difference]: Start difference. First operand has 91 places, 88 transitions, 410 flow. Second operand 8 states and 402 transitions. [2024-11-19 09:52:39,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 101 transitions, 603 flow [2024-11-19 09:52:39,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 101 transitions, 591 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:52:39,613 INFO L231 Difference]: Finished difference. Result has 95 places, 89 transitions, 436 flow [2024-11-19 09:52:39,613 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=436, PETRI_PLACES=95, PETRI_TRANSITIONS=89} [2024-11-19 09:52:39,614 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 16 predicate places. [2024-11-19 09:52:39,614 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 89 transitions, 436 flow [2024-11-19 09:52:39,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 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) [2024-11-19 09:52:39,615 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:39,615 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:52:39,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 09:52:39,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:52:39,819 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:39,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:39,819 INFO L85 PathProgramCache]: Analyzing trace with hash 208725063, now seen corresponding path program 1 times [2024-11-19 09:52:39,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:39,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720082735] [2024-11-19 09:52:39,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:39,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:39,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:39,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720082735] [2024-11-19 09:52:39,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720082735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:52:39,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:52:39,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:52:39,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321894141] [2024-11-19 09:52:39,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:52:39,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:52:39,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:39,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:52:39,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:52:39,964 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 80 [2024-11-19 09:52:39,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 89 transitions, 436 flow. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 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) [2024-11-19 09:52:39,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:39,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 80 [2024-11-19 09:52:39,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:40,153 INFO L124 PetriNetUnfolderBase]: 768/1733 cut-off events. [2024-11-19 09:52:40,153 INFO L125 PetriNetUnfolderBase]: For 4458/4950 co-relation queries the response was YES. [2024-11-19 09:52:40,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5063 conditions, 1733 events. 768/1733 cut-off events. For 4458/4950 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 11091 event pairs, 468 based on Foata normal form. 112/1542 useless extension candidates. Maximal degree in co-relation 2501. Up to 1060 conditions per place. [2024-11-19 09:52:40,173 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 55 selfloop transitions, 5 changer transitions 0/87 dead transitions. [2024-11-19 09:52:40,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 87 transitions, 552 flow [2024-11-19 09:52:40,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:52:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:52:40,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2024-11-19 09:52:40,175 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.565 [2024-11-19 09:52:40,175 INFO L175 Difference]: Start difference. First operand has 95 places, 89 transitions, 436 flow. Second operand 5 states and 226 transitions. [2024-11-19 09:52:40,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 87 transitions, 552 flow [2024-11-19 09:52:40,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 87 transitions, 531 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 09:52:40,179 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 421 flow [2024-11-19 09:52:40,179 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=421, PETRI_PLACES=91, PETRI_TRANSITIONS=87} [2024-11-19 09:52:40,179 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 12 predicate places. [2024-11-19 09:52:40,179 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 421 flow [2024-11-19 09:52:40,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 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) [2024-11-19 09:52:40,180 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:40,180 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:52:40,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 09:52:40,180 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:40,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:40,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1038931130, now seen corresponding path program 1 times [2024-11-19 09:52:40,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:40,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037380478] [2024-11-19 09:52:40,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:40,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:52:40,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:40,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037380478] [2024-11-19 09:52:40,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037380478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:52:40,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818364996] [2024-11-19 09:52:40,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:40,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:52:40,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:52:40,486 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:52:40,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 09:52:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:40,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-19 09:52:40,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:52:40,570 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 [2024-11-19 09:52:40,608 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 09:52:40,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2024-11-19 09:52:40,664 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-11-19 09:52:40,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2024-11-19 09:52:40,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:40,845 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:52:41,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:41,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818364996] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 09:52:41,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:52:41,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 16 [2024-11-19 09:52:41,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661144264] [2024-11-19 09:52:41,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:52:41,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:52:41,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:41,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:52:41,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-19 09:52:41,406 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2024-11-19 09:52:41,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 87 transitions, 421 flow. Second operand has 7 states, 7 states have (on average 45.57142857142857) internal successors, (319), 7 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:52:41,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:41,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2024-11-19 09:52:41,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:41,814 INFO L124 PetriNetUnfolderBase]: 1182/2597 cut-off events. [2024-11-19 09:52:41,814 INFO L125 PetriNetUnfolderBase]: For 4309/5021 co-relation queries the response was YES. [2024-11-19 09:52:41,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7093 conditions, 2597 events. 1182/2597 cut-off events. For 4309/5021 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 17755 event pairs, 436 based on Foata normal form. 30/2254 useless extension candidates. Maximal degree in co-relation 3516. Up to 1058 conditions per place. [2024-11-19 09:52:41,824 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 64 selfloop transitions, 10 changer transitions 0/100 dead transitions. [2024-11-19 09:52:41,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 100 transitions, 631 flow [2024-11-19 09:52:41,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:52:41,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:52:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 351 transitions. [2024-11-19 09:52:41,828 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6267857142857143 [2024-11-19 09:52:41,828 INFO L175 Difference]: Start difference. First operand has 91 places, 87 transitions, 421 flow. Second operand 7 states and 351 transitions. [2024-11-19 09:52:41,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 100 transitions, 631 flow [2024-11-19 09:52:41,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 100 transitions, 623 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:52:41,831 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 449 flow [2024-11-19 09:52:41,831 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=449, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2024-11-19 09:52:41,831 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 17 predicate places. [2024-11-19 09:52:41,832 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 449 flow [2024-11-19 09:52:41,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.57142857142857) internal successors, (319), 7 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:52:41,832 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:41,832 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:52:41,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-19 09:52:42,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 09:52:42,037 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:42,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:42,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1278650707, now seen corresponding path program 1 times [2024-11-19 09:52:42,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:42,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273423320] [2024-11-19 09:52:42,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:42,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:42,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:42,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:42,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273423320] [2024-11-19 09:52:42,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273423320] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:52:42,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246948942] [2024-11-19 09:52:42,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:42,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:52:42,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:52:42,121 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:52:42,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 09:52:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:42,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:52:42,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:52:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:42,255 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:52:42,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:42,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246948942] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:52:42,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:52:42,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-19 09:52:42,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380973426] [2024-11-19 09:52:42,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:52:42,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:52:42,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:42,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:52:42,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:52:42,421 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2024-11-19 09:52:42,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 449 flow. Second operand has 14 states, 14 states have (on average 46.357142857142854) internal successors, (649), 14 states have internal predecessors, (649), 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) [2024-11-19 09:52:42,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:42,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2024-11-19 09:52:42,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:42,762 INFO L124 PetriNetUnfolderBase]: 968/2097 cut-off events. [2024-11-19 09:52:42,763 INFO L125 PetriNetUnfolderBase]: For 5066/5471 co-relation queries the response was YES. [2024-11-19 09:52:42,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6217 conditions, 2097 events. 968/2097 cut-off events. For 5066/5471 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 13251 event pairs, 468 based on Foata normal form. 34/1861 useless extension candidates. Maximal degree in co-relation 3449. Up to 762 conditions per place. [2024-11-19 09:52:42,772 INFO L140 encePairwiseOnDemand]: 63/80 looper letters, 79 selfloop transitions, 31 changer transitions 0/138 dead transitions. [2024-11-19 09:52:42,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 138 transitions, 901 flow [2024-11-19 09:52:42,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:52:42,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:52:42,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 545 transitions. [2024-11-19 09:52:42,773 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.68125 [2024-11-19 09:52:42,773 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 449 flow. Second operand 10 states and 545 transitions. [2024-11-19 09:52:42,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 138 transitions, 901 flow [2024-11-19 09:52:42,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 138 transitions, 878 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 09:52:42,776 INFO L231 Difference]: Finished difference. Result has 103 places, 92 transitions, 550 flow [2024-11-19 09:52:42,777 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=550, PETRI_PLACES=103, PETRI_TRANSITIONS=92} [2024-11-19 09:52:42,777 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 24 predicate places. [2024-11-19 09:52:42,777 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 92 transitions, 550 flow [2024-11-19 09:52:42,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 46.357142857142854) internal successors, (649), 14 states have internal predecessors, (649), 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) [2024-11-19 09:52:42,777 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:42,777 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:52:42,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 09:52:42,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 09:52:42,978 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:42,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:42,978 INFO L85 PathProgramCache]: Analyzing trace with hash 2126195169, now seen corresponding path program 1 times [2024-11-19 09:52:42,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:42,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503397529] [2024-11-19 09:52:42,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:42,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:43,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:43,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:43,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503397529] [2024-11-19 09:52:43,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503397529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:52:43,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:52:43,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:52:43,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123742190] [2024-11-19 09:52:43,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:52:43,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:52:43,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:43,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:52:43,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:52:43,680 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 80 [2024-11-19 09:52:43,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 92 transitions, 550 flow. Second operand has 10 states, 10 states have (on average 35.1) internal successors, (351), 10 states have internal predecessors, (351), 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) [2024-11-19 09:52:43,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:43,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 80 [2024-11-19 09:52:43,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:44,107 INFO L124 PetriNetUnfolderBase]: 2158/4031 cut-off events. [2024-11-19 09:52:44,107 INFO L125 PetriNetUnfolderBase]: For 12953/13522 co-relation queries the response was YES. [2024-11-19 09:52:44,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13189 conditions, 4031 events. 2158/4031 cut-off events. For 12953/13522 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 26345 event pairs, 708 based on Foata normal form. 0/3555 useless extension candidates. Maximal degree in co-relation 7229. Up to 1346 conditions per place. [2024-11-19 09:52:44,127 INFO L140 encePairwiseOnDemand]: 72/80 looper letters, 100 selfloop transitions, 9 changer transitions 0/131 dead transitions. [2024-11-19 09:52:44,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 131 transitions, 1084 flow [2024-11-19 09:52:44,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:52:44,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:52:44,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 291 transitions. [2024-11-19 09:52:44,129 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5196428571428572 [2024-11-19 09:52:44,129 INFO L175 Difference]: Start difference. First operand has 103 places, 92 transitions, 550 flow. Second operand 7 states and 291 transitions. [2024-11-19 09:52:44,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 131 transitions, 1084 flow [2024-11-19 09:52:44,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 131 transitions, 1025 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-11-19 09:52:44,137 INFO L231 Difference]: Finished difference. Result has 102 places, 91 transitions, 511 flow [2024-11-19 09:52:44,137 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=511, PETRI_PLACES=102, PETRI_TRANSITIONS=91} [2024-11-19 09:52:44,138 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 23 predicate places. [2024-11-19 09:52:44,138 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 91 transitions, 511 flow [2024-11-19 09:52:44,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 35.1) internal successors, (351), 10 states have internal predecessors, (351), 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) [2024-11-19 09:52:44,138 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:44,138 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:52:44,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 09:52:44,138 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:44,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:44,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2142094689, now seen corresponding path program 1 times [2024-11-19 09:52:44,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:44,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857921888] [2024-11-19 09:52:44,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:44,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:44,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:44,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857921888] [2024-11-19 09:52:44,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857921888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:52:44,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:52:44,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:52:44,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994857731] [2024-11-19 09:52:44,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:52:44,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:52:44,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:44,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:52:44,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:52:44,219 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 80 [2024-11-19 09:52:44,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 91 transitions, 511 flow. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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) [2024-11-19 09:52:44,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:44,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 80 [2024-11-19 09:52:44,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:44,358 INFO L124 PetriNetUnfolderBase]: 728/1671 cut-off events. [2024-11-19 09:52:44,358 INFO L125 PetriNetUnfolderBase]: For 5488/5913 co-relation queries the response was YES. [2024-11-19 09:52:44,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5871 conditions, 1671 events. 728/1671 cut-off events. For 5488/5913 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 10430 event pairs, 468 based on Foata normal form. 89/1655 useless extension candidates. Maximal degree in co-relation 3500. Up to 1024 conditions per place. [2024-11-19 09:52:44,365 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 60 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2024-11-19 09:52:44,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 88 transitions, 631 flow [2024-11-19 09:52:44,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:52:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:52:44,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2024-11-19 09:52:44,366 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5875 [2024-11-19 09:52:44,366 INFO L175 Difference]: Start difference. First operand has 102 places, 91 transitions, 511 flow. Second operand 4 states and 188 transitions. [2024-11-19 09:52:44,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 88 transitions, 631 flow [2024-11-19 09:52:44,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 88 transitions, 613 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 09:52:44,372 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 493 flow [2024-11-19 09:52:44,372 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=493, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2024-11-19 09:52:44,373 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 17 predicate places. [2024-11-19 09:52:44,373 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 493 flow [2024-11-19 09:52:44,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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) [2024-11-19 09:52:44,373 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:44,373 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:52:44,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 09:52:44,373 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:44,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:44,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2142094690, now seen corresponding path program 1 times [2024-11-19 09:52:44,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:44,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540401838] [2024-11-19 09:52:44,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:44,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:44,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:44,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540401838] [2024-11-19 09:52:44,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540401838] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:52:44,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698006372] [2024-11-19 09:52:44,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:44,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:52:44,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:52:44,498 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:52:44,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 09:52:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:44,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-19 09:52:44,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:52:44,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 09:52:44,604 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 15 treesize of output 11 [2024-11-19 09:52:44,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 09:52:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:44,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:52:44,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:44,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698006372] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 09:52:44,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:52:44,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 12 [2024-11-19 09:52:44,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250601242] [2024-11-19 09:52:44,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:52:44,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:52:44,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:44,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:52:44,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:52:44,979 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2024-11-19 09:52:44,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 493 flow. Second operand has 7 states, 7 states have (on average 46.57142857142857) internal successors, (326), 7 states have internal predecessors, (326), 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) [2024-11-19 09:52:44,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:44,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2024-11-19 09:52:44,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:45,298 INFO L124 PetriNetUnfolderBase]: 960/2153 cut-off events. [2024-11-19 09:52:45,299 INFO L125 PetriNetUnfolderBase]: For 5913/6298 co-relation queries the response was YES. [2024-11-19 09:52:45,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7161 conditions, 2153 events. 960/2153 cut-off events. For 5913/6298 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 13809 event pairs, 468 based on Foata normal form. 96/2106 useless extension candidates. Maximal degree in co-relation 4348. Up to 1094 conditions per place. [2024-11-19 09:52:45,308 INFO L140 encePairwiseOnDemand]: 72/80 looper letters, 72 selfloop transitions, 9 changer transitions 0/105 dead transitions. [2024-11-19 09:52:45,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 105 transitions, 780 flow [2024-11-19 09:52:45,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:52:45,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:52:45,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 357 transitions. [2024-11-19 09:52:45,309 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6375 [2024-11-19 09:52:45,310 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 493 flow. Second operand 7 states and 357 transitions. [2024-11-19 09:52:45,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 105 transitions, 780 flow [2024-11-19 09:52:45,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 105 transitions, 776 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:52:45,315 INFO L231 Difference]: Finished difference. Result has 101 places, 89 transitions, 523 flow [2024-11-19 09:52:45,315 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=523, PETRI_PLACES=101, PETRI_TRANSITIONS=89} [2024-11-19 09:52:45,315 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 22 predicate places. [2024-11-19 09:52:45,315 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 89 transitions, 523 flow [2024-11-19 09:52:45,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.57142857142857) internal successors, (326), 7 states have internal predecessors, (326), 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) [2024-11-19 09:52:45,316 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:45,316 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:52:45,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-19 09:52:45,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-19 09:52:45,521 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:45,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:45,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1487541541, now seen corresponding path program 1 times [2024-11-19 09:52:45,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:45,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883942289] [2024-11-19 09:52:45,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:45,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:52:45,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:45,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883942289] [2024-11-19 09:52:45,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883942289] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:52:45,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32372681] [2024-11-19 09:52:45,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:45,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:52:45,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:52:45,797 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:52:45,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 09:52:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:45,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-19 09:52:45,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:52:45,905 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 [2024-11-19 09:52:45,964 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 09:52:45,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2024-11-19 09:52:46,030 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-19 09:52:46,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 37 [2024-11-19 09:52:46,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:52:46,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:52:46,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:52:46,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32372681] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:52:46,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:52:46,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 26 [2024-11-19 09:52:46,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252482598] [2024-11-19 09:52:46,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:52:46,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 09:52:46,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:46,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 09:52:46,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2024-11-19 09:52:48,453 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 80 [2024-11-19 09:52:48,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 89 transitions, 523 flow. Second operand has 28 states, 28 states have (on average 36.25) internal successors, (1015), 28 states have internal predecessors, (1015), 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) [2024-11-19 09:52:48,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:48,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 80 [2024-11-19 09:52:48,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:49,755 INFO L124 PetriNetUnfolderBase]: 1196/1939 cut-off events. [2024-11-19 09:52:49,756 INFO L125 PetriNetUnfolderBase]: For 14105/15463 co-relation queries the response was YES. [2024-11-19 09:52:49,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8409 conditions, 1939 events. 1196/1939 cut-off events. For 14105/15463 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9280 event pairs, 324 based on Foata normal form. 0/1809 useless extension candidates. Maximal degree in co-relation 5619. Up to 433 conditions per place. [2024-11-19 09:52:49,769 INFO L140 encePairwiseOnDemand]: 64/80 looper letters, 110 selfloop transitions, 30 changer transitions 0/162 dead transitions. [2024-11-19 09:52:49,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 162 transitions, 1350 flow [2024-11-19 09:52:49,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 09:52:49,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-19 09:52:49,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 801 transitions. [2024-11-19 09:52:49,771 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.500625 [2024-11-19 09:52:49,771 INFO L175 Difference]: Start difference. First operand has 101 places, 89 transitions, 523 flow. Second operand 20 states and 801 transitions. [2024-11-19 09:52:49,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 162 transitions, 1350 flow [2024-11-19 09:52:49,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 162 transitions, 1295 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 09:52:49,776 INFO L231 Difference]: Finished difference. Result has 114 places, 93 transitions, 581 flow [2024-11-19 09:52:49,777 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=581, PETRI_PLACES=114, PETRI_TRANSITIONS=93} [2024-11-19 09:52:49,777 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 35 predicate places. [2024-11-19 09:52:49,777 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 93 transitions, 581 flow [2024-11-19 09:52:49,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 36.25) internal successors, (1015), 28 states have internal predecessors, (1015), 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) [2024-11-19 09:52:49,778 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:49,778 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:52:49,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-19 09:52:49,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-19 09:52:49,978 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:49,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:49,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1263688391, now seen corresponding path program 1 times [2024-11-19 09:52:49,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:49,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191300408] [2024-11-19 09:52:49,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:49,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:50,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:50,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:50,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191300408] [2024-11-19 09:52:50,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191300408] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:52:50,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357846119] [2024-11-19 09:52:50,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:50,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:52:50,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:52:50,114 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:52:50,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 09:52:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:50,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:52:50,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:52:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:50,272 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:52:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:52:50,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357846119] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:52:50,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:52:50,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-11-19 09:52:50,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914829137] [2024-11-19 09:52:50,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:52:50,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 09:52:50,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:50,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 09:52:50,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2024-11-19 09:52:50,464 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2024-11-19 09:52:50,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 93 transitions, 581 flow. Second operand has 16 states, 16 states have (on average 46.4375) internal successors, (743), 16 states have internal predecessors, (743), 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) [2024-11-19 09:52:50,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:50,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2024-11-19 09:52:50,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:50,817 INFO L124 PetriNetUnfolderBase]: 1015/1905 cut-off events. [2024-11-19 09:52:50,817 INFO L125 PetriNetUnfolderBase]: For 8583/9385 co-relation queries the response was YES. [2024-11-19 09:52:50,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7294 conditions, 1905 events. 1015/1905 cut-off events. For 8583/9385 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 10338 event pairs, 468 based on Foata normal form. 35/1881 useless extension candidates. Maximal degree in co-relation 4792. Up to 823 conditions per place. [2024-11-19 09:52:50,826 INFO L140 encePairwiseOnDemand]: 63/80 looper letters, 78 selfloop transitions, 31 changer transitions 0/133 dead transitions. [2024-11-19 09:52:50,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 133 transitions, 1019 flow [2024-11-19 09:52:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:52:50,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:52:50,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 543 transitions. [2024-11-19 09:52:50,828 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.67875 [2024-11-19 09:52:50,828 INFO L175 Difference]: Start difference. First operand has 114 places, 93 transitions, 581 flow. Second operand 10 states and 543 transitions. [2024-11-19 09:52:50,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 133 transitions, 1019 flow [2024-11-19 09:52:50,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 133 transitions, 977 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-11-19 09:52:50,833 INFO L231 Difference]: Finished difference. Result has 121 places, 97 transitions, 660 flow [2024-11-19 09:52:50,833 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=660, PETRI_PLACES=121, PETRI_TRANSITIONS=97} [2024-11-19 09:52:50,833 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 42 predicate places. [2024-11-19 09:52:50,834 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 97 transitions, 660 flow [2024-11-19 09:52:50,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 46.4375) internal successors, (743), 16 states have internal predecessors, (743), 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) [2024-11-19 09:52:50,834 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:50,834 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:52:50,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-19 09:52:51,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-19 09:52:51,035 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:51,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:51,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1130851741, now seen corresponding path program 1 times [2024-11-19 09:52:51,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:51,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733136730] [2024-11-19 09:52:51,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:51,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:52:51,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:51,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733136730] [2024-11-19 09:52:51,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733136730] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:52:51,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724883344] [2024-11-19 09:52:51,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:52:51,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:52:51,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:52:51,280 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:52:51,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-19 09:52:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:52:51,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-19 09:52:51,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:52:51,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 09:52:51,417 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 15 treesize of output 11 [2024-11-19 09:52:51,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 09:52:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:52:51,572 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:52:51,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:52:51,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724883344] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:52:51,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:52:51,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2024-11-19 09:52:51,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436613011] [2024-11-19 09:52:51,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:52:51,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-19 09:52:51,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:51,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 09:52:51,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2024-11-19 09:52:53,459 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 80 [2024-11-19 09:52:53,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 97 transitions, 660 flow. Second operand has 25 states, 25 states have (on average 41.52) internal successors, (1038), 25 states have internal predecessors, (1038), 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) [2024-11-19 09:52:53,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:53,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 80 [2024-11-19 09:52:53,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:52:54,231 INFO L124 PetriNetUnfolderBase]: 948/1641 cut-off events. [2024-11-19 09:52:54,232 INFO L125 PetriNetUnfolderBase]: For 11579/12572 co-relation queries the response was YES. [2024-11-19 09:52:54,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7301 conditions, 1641 events. 948/1641 cut-off events. For 11579/12572 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 8153 event pairs, 324 based on Foata normal form. 74/1594 useless extension candidates. Maximal degree in co-relation 4903. Up to 384 conditions per place. [2024-11-19 09:52:54,246 INFO L140 encePairwiseOnDemand]: 65/80 looper letters, 106 selfloop transitions, 29 changer transitions 0/157 dead transitions. [2024-11-19 09:52:54,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 157 transitions, 1408 flow [2024-11-19 09:52:54,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 09:52:54,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-19 09:52:54,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 665 transitions. [2024-11-19 09:52:54,249 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-11-19 09:52:54,249 INFO L175 Difference]: Start difference. First operand has 121 places, 97 transitions, 660 flow. Second operand 14 states and 665 transitions. [2024-11-19 09:52:54,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 157 transitions, 1408 flow [2024-11-19 09:52:54,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 157 transitions, 1349 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-11-19 09:52:54,259 INFO L231 Difference]: Finished difference. Result has 127 places, 96 transitions, 661 flow [2024-11-19 09:52:54,259 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=661, PETRI_PLACES=127, PETRI_TRANSITIONS=96} [2024-11-19 09:52:54,259 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 48 predicate places. [2024-11-19 09:52:54,260 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 96 transitions, 661 flow [2024-11-19 09:52:54,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 41.52) internal successors, (1038), 25 states have internal predecessors, (1038), 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) [2024-11-19 09:52:54,260 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:52:54,261 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:52:54,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-19 09:52:54,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-19 09:52:54,465 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:52:54,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:52:54,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1148899504, now seen corresponding path program 2 times [2024-11-19 09:52:54,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:52:54,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700912730] [2024-11-19 09:52:54,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:52:54,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:52:54,524 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:52:54,525 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:52:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 09:52:55,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:52:55,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700912730] [2024-11-19 09:52:55,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700912730] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:52:55,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033935619] [2024-11-19 09:52:55,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:52:55,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:52:55,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:52:55,235 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:52:55,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-19 09:52:55,325 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:52:55,325 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:52:55,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-19 09:52:55,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:52:55,332 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 [2024-11-19 09:52:55,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:52:55,400 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 09:52:55,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 09:52:55,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2024-11-19 09:52:55,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:52:55,565 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 09:52:55,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2024-11-19 09:52:55,574 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:52:55,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 09:52:55,627 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-19 09:52:55,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-11-19 09:52:55,822 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 09:52:55,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:52:56,291 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 09:52:56,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033935619] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:52:56,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:52:56,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 24 [2024-11-19 09:52:56,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070302760] [2024-11-19 09:52:56,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:52:56,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 09:52:56,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:52:56,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 09:52:56,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2024-11-19 09:52:58,432 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 80 [2024-11-19 09:52:58,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 96 transitions, 661 flow. Second operand has 26 states, 26 states have (on average 31.53846153846154) internal successors, (820), 26 states have internal predecessors, (820), 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) [2024-11-19 09:52:58,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:52:58,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 80 [2024-11-19 09:52:58,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:00,359 INFO L124 PetriNetUnfolderBase]: 2652/4395 cut-off events. [2024-11-19 09:53:00,359 INFO L125 PetriNetUnfolderBase]: For 18760/19361 co-relation queries the response was YES. [2024-11-19 09:53:00,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17272 conditions, 4395 events. 2652/4395 cut-off events. For 18760/19361 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 24498 event pairs, 420 based on Foata normal form. 290/4645 useless extension candidates. Maximal degree in co-relation 11232. Up to 654 conditions per place. [2024-11-19 09:53:00,395 INFO L140 encePairwiseOnDemand]: 63/80 looper letters, 172 selfloop transitions, 33 changer transitions 0/222 dead transitions. [2024-11-19 09:53:00,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 222 transitions, 1743 flow [2024-11-19 09:53:00,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 09:53:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-19 09:53:00,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 708 transitions. [2024-11-19 09:53:00,397 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2024-11-19 09:53:00,397 INFO L175 Difference]: Start difference. First operand has 127 places, 96 transitions, 661 flow. Second operand 18 states and 708 transitions. [2024-11-19 09:53:00,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 222 transitions, 1743 flow [2024-11-19 09:53:00,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 222 transitions, 1643 flow, removed 0 selfloop flow, removed 13 redundant places. [2024-11-19 09:53:00,413 INFO L231 Difference]: Finished difference. Result has 133 places, 100 transitions, 712 flow [2024-11-19 09:53:00,414 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=712, PETRI_PLACES=133, PETRI_TRANSITIONS=100} [2024-11-19 09:53:00,415 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 54 predicate places. [2024-11-19 09:53:00,415 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 100 transitions, 712 flow [2024-11-19 09:53:00,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 31.53846153846154) internal successors, (820), 26 states have internal predecessors, (820), 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) [2024-11-19 09:53:00,415 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:00,416 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:00,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-19 09:53:00,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:00,616 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:53:00,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:00,617 INFO L85 PathProgramCache]: Analyzing trace with hash 35578192, now seen corresponding path program 1 times [2024-11-19 09:53:00,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:00,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523677515] [2024-11-19 09:53:00,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:00,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:00,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:53:00,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:00,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523677515] [2024-11-19 09:53:00,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523677515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:00,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84207915] [2024-11-19 09:53:00,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:00,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:00,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:00,707 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:00,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-19 09:53:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:00,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:53:00,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:00,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:53:00,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:00,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:53:00,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84207915] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:00,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:53:00,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-11-19 09:53:00,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790232051] [2024-11-19 09:53:00,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:00,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:53:00,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:00,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:53:00,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:53:00,870 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2024-11-19 09:53:00,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 100 transitions, 712 flow. Second operand has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 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) [2024-11-19 09:53:00,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:00,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2024-11-19 09:53:00,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:01,103 INFO L124 PetriNetUnfolderBase]: 1480/3004 cut-off events. [2024-11-19 09:53:01,104 INFO L125 PetriNetUnfolderBase]: For 14518/14939 co-relation queries the response was YES. [2024-11-19 09:53:01,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12136 conditions, 3004 events. 1480/3004 cut-off events. For 14518/14939 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 18826 event pairs, 547 based on Foata normal form. 102/3023 useless extension candidates. Maximal degree in co-relation 7607. Up to 1069 conditions per place. [2024-11-19 09:53:01,120 INFO L140 encePairwiseOnDemand]: 74/80 looper letters, 86 selfloop transitions, 10 changer transitions 0/120 dead transitions. [2024-11-19 09:53:01,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 120 transitions, 1025 flow [2024-11-19 09:53:01,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:53:01,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:53:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 268 transitions. [2024-11-19 09:53:01,121 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.67 [2024-11-19 09:53:01,122 INFO L175 Difference]: Start difference. First operand has 133 places, 100 transitions, 712 flow. Second operand 5 states and 268 transitions. [2024-11-19 09:53:01,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 120 transitions, 1025 flow [2024-11-19 09:53:01,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 120 transitions, 975 flow, removed 8 selfloop flow, removed 11 redundant places. [2024-11-19 09:53:01,131 INFO L231 Difference]: Finished difference. Result has 127 places, 100 transitions, 684 flow [2024-11-19 09:53:01,132 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=684, PETRI_PLACES=127, PETRI_TRANSITIONS=100} [2024-11-19 09:53:01,132 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 48 predicate places. [2024-11-19 09:53:01,132 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 100 transitions, 684 flow [2024-11-19 09:53:01,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 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) [2024-11-19 09:53:01,132 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:01,132 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:01,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-19 09:53:01,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-19 09:53:01,333 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:53:01,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:01,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1256146974, now seen corresponding path program 1 times [2024-11-19 09:53:01,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:01,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354955476] [2024-11-19 09:53:01,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:01,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 09:53:01,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:01,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354955476] [2024-11-19 09:53:01,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354955476] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:01,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505860838] [2024-11-19 09:53:01,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:01,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:01,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:01,775 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:01,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-19 09:53:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:01,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-19 09:53:01,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:01,913 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 [2024-11-19 09:53:01,964 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 09:53:01,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2024-11-19 09:53:02,034 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-11-19 09:53:02,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2024-11-19 09:53:02,425 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 09:53:02,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:02,700 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 09:53:02,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505860838] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:53:02,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:53:02,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 28 [2024-11-19 09:53:02,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044031989] [2024-11-19 09:53:02,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:53:02,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 09:53:02,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:02,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 09:53:02,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2024-11-19 09:53:06,101 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 80 [2024-11-19 09:53:06,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 100 transitions, 684 flow. Second operand has 29 states, 29 states have (on average 36.37931034482759) internal successors, (1055), 29 states have internal predecessors, (1055), 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) [2024-11-19 09:53:06,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:06,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 80 [2024-11-19 09:53:06,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:07,877 INFO L124 PetriNetUnfolderBase]: 2094/3528 cut-off events. [2024-11-19 09:53:07,877 INFO L125 PetriNetUnfolderBase]: For 19967/20995 co-relation queries the response was YES. [2024-11-19 09:53:07,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15152 conditions, 3528 events. 2094/3528 cut-off events. For 19967/20995 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 18649 event pairs, 828 based on Foata normal form. 146/3508 useless extension candidates. Maximal degree in co-relation 10079. Up to 833 conditions per place. [2024-11-19 09:53:07,908 INFO L140 encePairwiseOnDemand]: 64/80 looper letters, 116 selfloop transitions, 29 changer transitions 0/166 dead transitions. [2024-11-19 09:53:07,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 166 transitions, 1317 flow [2024-11-19 09:53:07,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 09:53:07,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-19 09:53:07,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 779 transitions. [2024-11-19 09:53:07,910 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5125 [2024-11-19 09:53:07,910 INFO L175 Difference]: Start difference. First operand has 127 places, 100 transitions, 684 flow. Second operand 19 states and 779 transitions. [2024-11-19 09:53:07,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 166 transitions, 1317 flow [2024-11-19 09:53:07,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 166 transitions, 1293 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-11-19 09:53:07,934 INFO L231 Difference]: Finished difference. Result has 145 places, 102 transitions, 747 flow [2024-11-19 09:53:07,935 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=747, PETRI_PLACES=145, PETRI_TRANSITIONS=102} [2024-11-19 09:53:07,935 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 66 predicate places. [2024-11-19 09:53:07,935 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 102 transitions, 747 flow [2024-11-19 09:53:07,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 36.37931034482759) internal successors, (1055), 29 states have internal predecessors, (1055), 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) [2024-11-19 09:53:07,936 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:07,936 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:07,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-19 09:53:08,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-19 09:53:08,141 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:53:08,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:08,141 INFO L85 PathProgramCache]: Analyzing trace with hash 285851250, now seen corresponding path program 1 times [2024-11-19 09:53:08,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:08,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036446803] [2024-11-19 09:53:08,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:08,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 09:53:08,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:08,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036446803] [2024-11-19 09:53:08,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036446803] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:08,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088747341] [2024-11-19 09:53:08,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:08,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:08,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:08,389 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:08,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-19 09:53:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:08,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-19 09:53:08,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:08,497 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 [2024-11-19 09:53:08,536 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-19 09:53:08,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-11-19 09:53:08,823 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 09:53:08,823 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:09,019 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 09:53:09,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088747341] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:53:09,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:53:09,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 24 [2024-11-19 09:53:09,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098240612] [2024-11-19 09:53:09,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:53:09,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-19 09:53:09,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:09,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 09:53:09,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2024-11-19 09:53:10,670 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 80 [2024-11-19 09:53:10,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 102 transitions, 747 flow. Second operand has 25 states, 25 states have (on average 37.48) internal successors, (937), 25 states have internal predecessors, (937), 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) [2024-11-19 09:53:10,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:10,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 80 [2024-11-19 09:53:10,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:11,716 INFO L124 PetriNetUnfolderBase]: 1579/2917 cut-off events. [2024-11-19 09:53:11,716 INFO L125 PetriNetUnfolderBase]: For 16485/17300 co-relation queries the response was YES. [2024-11-19 09:53:11,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12265 conditions, 2917 events. 1579/2917 cut-off events. For 16485/17300 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 16666 event pairs, 766 based on Foata normal form. 126/2896 useless extension candidates. Maximal degree in co-relation 7908. Up to 829 conditions per place. [2024-11-19 09:53:11,736 INFO L140 encePairwiseOnDemand]: 67/80 looper letters, 94 selfloop transitions, 22 changer transitions 0/141 dead transitions. [2024-11-19 09:53:11,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 141 transitions, 1167 flow [2024-11-19 09:53:11,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 09:53:11,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-19 09:53:11,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 665 transitions. [2024-11-19 09:53:11,742 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.51953125 [2024-11-19 09:53:11,742 INFO L175 Difference]: Start difference. First operand has 145 places, 102 transitions, 747 flow. Second operand 16 states and 665 transitions. [2024-11-19 09:53:11,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 141 transitions, 1167 flow [2024-11-19 09:53:11,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 141 transitions, 1087 flow, removed 1 selfloop flow, removed 18 redundant places. [2024-11-19 09:53:11,757 INFO L231 Difference]: Finished difference. Result has 143 places, 102 transitions, 715 flow [2024-11-19 09:53:11,757 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=715, PETRI_PLACES=143, PETRI_TRANSITIONS=102} [2024-11-19 09:53:11,761 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 64 predicate places. [2024-11-19 09:53:11,761 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 102 transitions, 715 flow [2024-11-19 09:53:11,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 37.48) internal successors, (937), 25 states have internal predecessors, (937), 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) [2024-11-19 09:53:11,762 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:11,762 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:11,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-19 09:53:11,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-19 09:53:11,966 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:53:11,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:11,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1972199434, now seen corresponding path program 2 times [2024-11-19 09:53:11,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:11,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125886017] [2024-11-19 09:53:11,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:53:11,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:11,997 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:53:11,997 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:12,515 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 09:53:12,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:12,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125886017] [2024-11-19 09:53:12,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125886017] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:12,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164878070] [2024-11-19 09:53:12,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:53:12,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:12,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:12,519 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:12,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-19 09:53:12,660 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:53:12,660 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:12,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-19 09:53:12,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:12,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 09:53:12,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:53:12,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:53:12,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:53:12,750 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 09:53:12,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 09:53:12,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:53:12,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:53:12,804 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 09:53:12,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 09:53:12,832 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:53:12,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 09:53:12,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:53:13,037 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 09:53:13,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:13,997 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 09:53:13,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164878070] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:53:13,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:53:13,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2024-11-19 09:53:13,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682375038] [2024-11-19 09:53:13,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:53:13,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-19 09:53:13,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:13,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-19 09:53:13,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2024-11-19 09:53:18,291 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 80 [2024-11-19 09:53:18,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 102 transitions, 715 flow. Second operand has 30 states, 30 states have (on average 31.466666666666665) internal successors, (944), 30 states have internal predecessors, (944), 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) [2024-11-19 09:53:18,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:18,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 80 [2024-11-19 09:53:18,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:20,063 INFO L124 PetriNetUnfolderBase]: 3762/6266 cut-off events. [2024-11-19 09:53:20,063 INFO L125 PetriNetUnfolderBase]: For 29228/29664 co-relation queries the response was YES. [2024-11-19 09:53:20,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23966 conditions, 6266 events. 3762/6266 cut-off events. For 29228/29664 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 37326 event pairs, 560 based on Foata normal form. 220/6397 useless extension candidates. Maximal degree in co-relation 16948. Up to 970 conditions per place. [2024-11-19 09:53:20,093 INFO L140 encePairwiseOnDemand]: 63/80 looper letters, 168 selfloop transitions, 34 changer transitions 0/223 dead transitions. [2024-11-19 09:53:20,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 223 transitions, 1816 flow [2024-11-19 09:53:20,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 09:53:20,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-19 09:53:20,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 699 transitions. [2024-11-19 09:53:20,095 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48541666666666666 [2024-11-19 09:53:20,095 INFO L175 Difference]: Start difference. First operand has 143 places, 102 transitions, 715 flow. Second operand 18 states and 699 transitions. [2024-11-19 09:53:20,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 223 transitions, 1816 flow [2024-11-19 09:53:20,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 223 transitions, 1782 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 09:53:20,117 INFO L231 Difference]: Finished difference. Result has 156 places, 109 transitions, 839 flow [2024-11-19 09:53:20,117 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=839, PETRI_PLACES=156, PETRI_TRANSITIONS=109} [2024-11-19 09:53:20,118 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 77 predicate places. [2024-11-19 09:53:20,118 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 109 transitions, 839 flow [2024-11-19 09:53:20,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 31.466666666666665) internal successors, (944), 30 states have internal predecessors, (944), 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) [2024-11-19 09:53:20,118 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:20,118 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:20,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-19 09:53:20,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-19 09:53:20,319 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:53:20,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:20,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1008641040, now seen corresponding path program 1 times [2024-11-19 09:53:20,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:20,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906540416] [2024-11-19 09:53:20,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:20,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:20,676 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 09:53:20,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:20,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906540416] [2024-11-19 09:53:20,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906540416] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:20,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708181708] [2024-11-19 09:53:20,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:20,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:20,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:20,678 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:20,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-19 09:53:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:20,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-19 09:53:20,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:20,797 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 [2024-11-19 09:53:20,835 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 09:53:20,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2024-11-19 09:53:20,899 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-11-19 09:53:20,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2024-11-19 09:53:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 09:53:21,273 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 09:53:21,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708181708] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:53:21,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:53:21,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 25 [2024-11-19 09:53:21,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140176889] [2024-11-19 09:53:21,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:53:21,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 09:53:21,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:21,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 09:53:21,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2024-11-19 09:53:23,853 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 80 [2024-11-19 09:53:23,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 109 transitions, 839 flow. Second operand has 26 states, 26 states have (on average 37.5) internal successors, (975), 26 states have internal predecessors, (975), 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) [2024-11-19 09:53:23,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:23,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 80 [2024-11-19 09:53:23,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:25,339 INFO L124 PetriNetUnfolderBase]: 2420/4342 cut-off events. [2024-11-19 09:53:25,339 INFO L125 PetriNetUnfolderBase]: For 26917/27835 co-relation queries the response was YES. [2024-11-19 09:53:25,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18899 conditions, 4342 events. 2420/4342 cut-off events. For 26917/27835 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 26766 event pairs, 947 based on Foata normal form. 158/4177 useless extension candidates. Maximal degree in co-relation 13004. Up to 1015 conditions per place. [2024-11-19 09:53:25,369 INFO L140 encePairwiseOnDemand]: 66/80 looper letters, 110 selfloop transitions, 28 changer transitions 0/169 dead transitions. [2024-11-19 09:53:25,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 169 transitions, 1464 flow [2024-11-19 09:53:25,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 09:53:25,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-11-19 09:53:25,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 722 transitions. [2024-11-19 09:53:25,371 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5308823529411765 [2024-11-19 09:53:25,371 INFO L175 Difference]: Start difference. First operand has 156 places, 109 transitions, 839 flow. Second operand 17 states and 722 transitions. [2024-11-19 09:53:25,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 169 transitions, 1464 flow [2024-11-19 09:53:25,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 169 transitions, 1388 flow, removed 7 selfloop flow, removed 14 redundant places. [2024-11-19 09:53:25,386 INFO L231 Difference]: Finished difference. Result has 161 places, 111 transitions, 847 flow [2024-11-19 09:53:25,386 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=847, PETRI_PLACES=161, PETRI_TRANSITIONS=111} [2024-11-19 09:53:25,386 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 82 predicate places. [2024-11-19 09:53:25,386 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 111 transitions, 847 flow [2024-11-19 09:53:25,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 37.5) internal successors, (975), 26 states have internal predecessors, (975), 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) [2024-11-19 09:53:25,387 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:25,387 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:25,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-19 09:53:25,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:25,590 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:53:25,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:25,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1203101900, now seen corresponding path program 1 times [2024-11-19 09:53:25,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:25,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010669431] [2024-11-19 09:53:25,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:25,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 09:53:25,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:25,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010669431] [2024-11-19 09:53:25,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010669431] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:25,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623934393] [2024-11-19 09:53:25,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:25,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:25,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:25,720 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:25,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-19 09:53:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:25,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 09:53:25,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 09:53:25,924 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:26,006 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 [2024-11-19 09:53:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 09:53:26,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623934393] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:53:26,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:53:26,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2024-11-19 09:53:26,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194160731] [2024-11-19 09:53:26,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:53:26,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 09:53:26,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:26,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 09:53:26,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-19 09:53:27,028 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2024-11-19 09:53:27,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 111 transitions, 847 flow. Second operand has 20 states, 20 states have (on average 46.25) internal successors, (925), 20 states have internal predecessors, (925), 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) [2024-11-19 09:53:27,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:27,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2024-11-19 09:53:27,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:27,676 INFO L124 PetriNetUnfolderBase]: 1899/3562 cut-off events. [2024-11-19 09:53:27,677 INFO L125 PetriNetUnfolderBase]: For 20918/21751 co-relation queries the response was YES. [2024-11-19 09:53:27,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15761 conditions, 3562 events. 1899/3562 cut-off events. For 20918/21751 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 22393 event pairs, 918 based on Foata normal form. 157/3417 useless extension candidates. Maximal degree in co-relation 11030. Up to 1055 conditions per place. [2024-11-19 09:53:27,702 INFO L140 encePairwiseOnDemand]: 67/80 looper letters, 87 selfloop transitions, 25 changer transitions 0/147 dead transitions. [2024-11-19 09:53:27,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 147 transitions, 1275 flow [2024-11-19 09:53:27,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:53:27,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:53:27,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 451 transitions. [2024-11-19 09:53:27,706 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7046875 [2024-11-19 09:53:27,706 INFO L175 Difference]: Start difference. First operand has 161 places, 111 transitions, 847 flow. Second operand 8 states and 451 transitions. [2024-11-19 09:53:27,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 147 transitions, 1275 flow [2024-11-19 09:53:27,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 147 transitions, 1229 flow, removed 1 selfloop flow, removed 13 redundant places. [2024-11-19 09:53:27,720 INFO L231 Difference]: Finished difference. Result has 156 places, 111 transitions, 856 flow [2024-11-19 09:53:27,720 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=856, PETRI_PLACES=156, PETRI_TRANSITIONS=111} [2024-11-19 09:53:27,720 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 77 predicate places. [2024-11-19 09:53:27,720 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 111 transitions, 856 flow [2024-11-19 09:53:27,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 46.25) internal successors, (925), 20 states have internal predecessors, (925), 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) [2024-11-19 09:53:27,721 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:27,721 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:27,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-19 09:53:27,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-19 09:53:27,925 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:53:27,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:27,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1124761769, now seen corresponding path program 2 times [2024-11-19 09:53:27,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:27,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765942953] [2024-11-19 09:53:27,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:53:27,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:27,950 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:53:27,950 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:28,215 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 09:53:28,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:28,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765942953] [2024-11-19 09:53:28,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765942953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:28,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122728449] [2024-11-19 09:53:28,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:53:28,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:28,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:28,219 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:28,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-19 09:53:28,329 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:53:28,329 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:28,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-19 09:53:28,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:28,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 09:53:28,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:53:28,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:53:28,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:53:28,516 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:53:28,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 09:53:28,620 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 09:53:28,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2024-11-19 09:53:28,790 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 09:53:28,790 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:29,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:53:29,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 99 [2024-11-19 09:53:29,313 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 09:53:29,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122728449] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:53:29,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:53:29,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 17 [2024-11-19 09:53:29,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871396324] [2024-11-19 09:53:29,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:53:29,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 09:53:29,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:29,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 09:53:29,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-11-19 09:53:30,453 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 80 [2024-11-19 09:53:30,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 111 transitions, 856 flow. Second operand has 19 states, 19 states have (on average 38.473684210526315) internal successors, (731), 19 states have internal predecessors, (731), 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) [2024-11-19 09:53:30,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:30,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 80 [2024-11-19 09:53:30,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:31,602 INFO L124 PetriNetUnfolderBase]: 5496/8522 cut-off events. [2024-11-19 09:53:31,602 INFO L125 PetriNetUnfolderBase]: For 42109/42516 co-relation queries the response was YES. [2024-11-19 09:53:31,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37211 conditions, 8522 events. 5496/8522 cut-off events. For 42109/42516 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 46651 event pairs, 1756 based on Foata normal form. 230/8519 useless extension candidates. Maximal degree in co-relation 27614. Up to 3135 conditions per place. [2024-11-19 09:53:31,654 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 131 selfloop transitions, 16 changer transitions 0/166 dead transitions. [2024-11-19 09:53:31,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 166 transitions, 1566 flow [2024-11-19 09:53:31,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:53:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:53:31,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 310 transitions. [2024-11-19 09:53:31,656 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2024-11-19 09:53:31,656 INFO L175 Difference]: Start difference. First operand has 156 places, 111 transitions, 856 flow. Second operand 7 states and 310 transitions. [2024-11-19 09:53:31,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 166 transitions, 1566 flow [2024-11-19 09:53:31,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 166 transitions, 1486 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-11-19 09:53:31,699 INFO L231 Difference]: Finished difference. Result has 152 places, 110 transitions, 822 flow [2024-11-19 09:53:31,699 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=822, PETRI_PLACES=152, PETRI_TRANSITIONS=110} [2024-11-19 09:53:31,702 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 73 predicate places. [2024-11-19 09:53:31,702 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 110 transitions, 822 flow [2024-11-19 09:53:31,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 38.473684210526315) internal successors, (731), 19 states have internal predecessors, (731), 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) [2024-11-19 09:53:31,703 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:31,703 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:31,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-19 09:53:31,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:31,903 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:53:31,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:31,904 INFO L85 PathProgramCache]: Analyzing trace with hash 613214785, now seen corresponding path program 1 times [2024-11-19 09:53:31,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:31,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778514910] [2024-11-19 09:53:31,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:31,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:32,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:53:32,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:32,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778514910] [2024-11-19 09:53:32,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778514910] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:32,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382270275] [2024-11-19 09:53:32,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:32,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:32,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:32,078 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:32,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-19 09:53:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:32,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:53:32,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:32,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:53:32,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:53:32,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382270275] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:53:32,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:53:32,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2024-11-19 09:53:32,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747428560] [2024-11-19 09:53:32,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:53:32,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:53:32,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:32,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:53:32,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:53:32,500 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2024-11-19 09:53:32,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 110 transitions, 822 flow. Second operand has 14 states, 14 states have (on average 46.285714285714285) internal successors, (648), 14 states have internal predecessors, (648), 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) [2024-11-19 09:53:32,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:32,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2024-11-19 09:53:32,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:33,282 INFO L124 PetriNetUnfolderBase]: 2738/5097 cut-off events. [2024-11-19 09:53:33,282 INFO L125 PetriNetUnfolderBase]: For 26450/27148 co-relation queries the response was YES. [2024-11-19 09:53:33,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22134 conditions, 5097 events. 2738/5097 cut-off events. For 26450/27148 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 33561 event pairs, 827 based on Foata normal form. 132/4710 useless extension candidates. Maximal degree in co-relation 15684. Up to 1379 conditions per place. [2024-11-19 09:53:33,326 INFO L140 encePairwiseOnDemand]: 70/80 looper letters, 154 selfloop transitions, 34 changer transitions 0/218 dead transitions. [2024-11-19 09:53:33,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 218 transitions, 2079 flow [2024-11-19 09:53:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:53:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:53:33,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 571 transitions. [2024-11-19 09:53:33,328 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6488636363636363 [2024-11-19 09:53:33,328 INFO L175 Difference]: Start difference. First operand has 152 places, 110 transitions, 822 flow. Second operand 11 states and 571 transitions. [2024-11-19 09:53:33,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 218 transitions, 2079 flow [2024-11-19 09:53:33,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 218 transitions, 1999 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 09:53:33,356 INFO L231 Difference]: Finished difference. Result has 158 places, 131 transitions, 1016 flow [2024-11-19 09:53:33,356 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1016, PETRI_PLACES=158, PETRI_TRANSITIONS=131} [2024-11-19 09:53:33,356 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 79 predicate places. [2024-11-19 09:53:33,357 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 131 transitions, 1016 flow [2024-11-19 09:53:33,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 46.285714285714285) internal successors, (648), 14 states have internal predecessors, (648), 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) [2024-11-19 09:53:33,358 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:33,358 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:33,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-11-19 09:53:33,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:33,559 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:53:33,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:33,560 INFO L85 PathProgramCache]: Analyzing trace with hash -23945963, now seen corresponding path program 2 times [2024-11-19 09:53:33,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:33,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253183773] [2024-11-19 09:53:33,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:53:33,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:33,645 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:53:33,646 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 09:53:33,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:33,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253183773] [2024-11-19 09:53:33,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253183773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:53:33,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:53:33,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:53:33,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490746085] [2024-11-19 09:53:33,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:33,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:53:33,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:33,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:53:33,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:53:34,067 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 80 [2024-11-19 09:53:34,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 131 transitions, 1016 flow. Second operand has 7 states, 7 states have (on average 43.42857142857143) internal successors, (304), 7 states have internal predecessors, (304), 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) [2024-11-19 09:53:34,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:34,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 80 [2024-11-19 09:53:34,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:34,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([795] L59-2-->L58-6: Formula: (let ((.cse0 (* 4 v_thread2Thread1of1ForFork2_~i~1_17))) (let ((.cse1 (+ .cse0 v_~C2~0.offset_11))) (and (<= (+ .cse0 v_~C2~0.offset_11 4) (select |v_#length_47| v_~C2~0.base_14)) (= (+ v_thread2Thread1of1ForFork2_~i~1_17 1) v_thread2Thread1of1ForFork2_~i~1_18) (= |v_#memory_int#1_35| (store |v_#memory_int#1_36| v_~C2~0.base_14 (store (select |v_#memory_int#1_36| v_~C2~0.base_14) .cse1 (+ |v_thread2Thread1of1ForFork2_#t~mem5_3| |v_thread2Thread1of1ForFork2_#t~mem4_3|)))) (= (select |v_#valid_52| v_~C2~0.base_14) 1) (<= 0 .cse1)))) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_17, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_3|, ~C2~0.offset=v_~C2~0.offset_11, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_3|, ~C2~0.base=v_~C2~0.base_14, #valid=|v_#valid_52|, #length=|v_#length_47|, #memory_int#1=|v_#memory_int#1_36|} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_18, ~C2~0.offset=v_~C2~0.offset_11, ~C2~0.base=v_~C2~0.base_14, thread2Thread1of1ForFork2_#t~post6=|v_thread2Thread1of1ForFork2_#t~post6_1|, #valid=|v_#valid_52|, #length=|v_#length_47|, #memory_int#1=|v_#memory_int#1_35|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread2Thread1of1ForFork2_#t~mem5, thread2Thread1of1ForFork2_#t~post6, #memory_int#1][72], [338#(= (select |#valid| ~A~0.base) 1), 592#(= (select |#valid| ~B~0.base) 1), 47#L89-4true, Black: 2042#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (or (and (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (or (not (= (select (store |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| v_ArrVal_571) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343|) 0)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344|) 0)))) (< 0 (+ 5 |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344|) 0)) (forall ((v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (or (not (= (select (store |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| v_ArrVal_571) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343|) 0)) (forall ((v_ArrVal_573 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| (* ~N~0 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| v_ArrVal_573) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| (* ~N~0 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))))))) (< ~N~0 2)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2054#(and (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (<= 1 thread1Thread1of1ForFork1_~i~0) (= (select |#valid| ~A~0.base) 1) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (* ~N~0 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))))), Black: 2032#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (= (select |#valid| ~A~0.base) 1) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))), Black: 3206#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 3210#(and (= ~B~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 208#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| 1)), Black: 148#true, 865#(= (select |#valid| ~C1~0.base) 1), 1167#(= (select |#valid| ~C2~0.base) 1), 49#thread1EXITtrue, Black: 1477#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (or (< ~N~0 1) (< 0 (+ ~B~0.offset 1))) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| Int)) (< (+ (* ~N~0 4) ~B~0.offset) (+ (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| (* (mod ~N~0 1073741824) 4)) ~B~0.base) 1))) (< ~N~0 1)) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_331| Int)) (< (+ (* ~N~0 4) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (+ (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_331| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1))) (< ~N~0 1)) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (or (< 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 1)) (< ~N~0 1))), 972#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), Black: 2965#(and (<= 0 ~N~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_#res#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)))) (<= ~N~0 1073741823) (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (<= 8 (select |#length| ~A~0.base))), Black: 727#(and (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4) (select |#length| ~A~0.base)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) (<= 0 ~A~0.offset)), Black: 2953#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 1306#(and (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~C2~0.offset)) (<= 0 ~C2~0.offset) (<= 1 (mod ~N~0 1073741824)) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~C2~0.offset 4) (select |#length| ~C2~0.base)) (<= (+ ~C2~0.offset 4) (select |#length| ~C2~0.base))), 3897#(and (<= ~N~0 1073741823) (<= (* ~N~0 4) (select |#length| ~C1~0.base)) (= ~C1~0.offset 0)), Black: 859#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_314| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_313| Int)) (< 3 (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_314| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_313| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_314|))) (<= (+ ~C1~0.offset 4) (select |#length| ~C1~0.base)) (<= (+ ~C1~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~C1~0.base)) (<= 0 ~C1~0.offset) (<= 0 (+ ~C1~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))), 429#(and (<= 0 ~A~0.offset) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| (* (mod ~N~0 1073741824) 4)) ~A~0.base)))), 2957#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base))), 3016#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 2724#(and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| ~C1~0.base)) (<= (div (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 4) 1073741823) (= (mod (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 4) 0))) (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 1) (= ~C1~0.offset 0)), 695#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 ~A~0.offset)), 2652#(or (and (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (< (mod ~N~0 1073741824) 2)), 2040#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (or (and (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (or (not (= (select (store |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| v_ArrVal_571) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343|) 0)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344|) 0)))) (< 0 (+ 5 |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344|) 0)) (forall ((v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (or (not (= (select (store |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| v_ArrVal_571) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343|) 0)) (forall ((v_ArrVal_573 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| (* ~N~0 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| v_ArrVal_573) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| (* ~N~0 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))))))) (< ~N~0 2)) (= (select |#valid| ~A~0.base) 1)), Black: 3432#(and (= thread2Thread1of1ForFork2_~i~1 1) (= ~C2~0.offset 0) (<= 8 (select |#length| ~C2~0.base))), Black: 3878#(and (<= 1 ~N~0) (<= ~M~0 0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 1002#(and (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~B~0.offset)) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~B~0.offset 4) (select |#length| ~B~0.base)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), Black: 3746#(and (<= 1 ~N~0) (<= ~M~0 0)), 2472#(and (or (and (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_351| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_351| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (< (mod ~N~0 1073741824) 2)) (or (< (mod ~N~0 1073741824) 2) (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| Int)) (<= (+ ~B~0.offset 8) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 (+ ~B~0.offset 4))))), 1487#(and (<= 0 ~M~0) (= ~B~0.offset 0) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (div (select |#length| ~B~0.base) 4)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~M~0 ~N~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (* ~N~0 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork0_~i~2) (= (* ~N~0 4) (select |#length| ~B~0.base))), 57#L67true, Black: 291#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (+ (* (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 4294967296) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= (mod |ULTIMATE.start_create_fresh_uint_array_~size#1| 4294967296) 1073741823) (<= (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 0) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0)), 3876#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0)), 556#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), Black: 2480#(and (= (mod (* (select |#length| ~B~0.base) 3) 4) 0) (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (exists ((~C1~0.base Int)) (= (select |#length| ~B~0.base) (select |#length| ~C1~0.base))) (<= 2 ~N~0) (<= 8 (select |#length| ~B~0.base)) (<= 0 (+ 1073741823 (div (* (select |#length| ~B~0.base) (- 1)) 4)))), 199#(or (< (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (< ~N~0 2)), Black: 1072#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), 2064#(<= 1 ~N~0), 64#L58-6true]) [2024-11-19 09:53:34,363 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-19 09:53:34,363 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:53:34,363 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:53:34,363 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:53:34,395 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([795] L59-2-->L58-6: Formula: (let ((.cse0 (* 4 v_thread2Thread1of1ForFork2_~i~1_17))) (let ((.cse1 (+ .cse0 v_~C2~0.offset_11))) (and (<= (+ .cse0 v_~C2~0.offset_11 4) (select |v_#length_47| v_~C2~0.base_14)) (= (+ v_thread2Thread1of1ForFork2_~i~1_17 1) v_thread2Thread1of1ForFork2_~i~1_18) (= |v_#memory_int#1_35| (store |v_#memory_int#1_36| v_~C2~0.base_14 (store (select |v_#memory_int#1_36| v_~C2~0.base_14) .cse1 (+ |v_thread2Thread1of1ForFork2_#t~mem5_3| |v_thread2Thread1of1ForFork2_#t~mem4_3|)))) (= (select |v_#valid_52| v_~C2~0.base_14) 1) (<= 0 .cse1)))) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_17, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_3|, ~C2~0.offset=v_~C2~0.offset_11, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_3|, ~C2~0.base=v_~C2~0.base_14, #valid=|v_#valid_52|, #length=|v_#length_47|, #memory_int#1=|v_#memory_int#1_36|} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_18, ~C2~0.offset=v_~C2~0.offset_11, ~C2~0.base=v_~C2~0.base_14, thread2Thread1of1ForFork2_#t~post6=|v_thread2Thread1of1ForFork2_#t~post6_1|, #valid=|v_#valid_52|, #length=|v_#length_47|, #memory_int#1=|v_#memory_int#1_35|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread2Thread1of1ForFork2_#t~mem5, thread2Thread1of1ForFork2_#t~post6, #memory_int#1][72], [338#(= (select |#valid| ~A~0.base) 1), 592#(= (select |#valid| ~B~0.base) 1), Black: 2042#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (or (and (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (or (not (= (select (store |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| v_ArrVal_571) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343|) 0)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344|) 0)))) (< 0 (+ 5 |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344|) 0)) (forall ((v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (or (not (= (select (store |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| v_ArrVal_571) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343|) 0)) (forall ((v_ArrVal_573 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| (* ~N~0 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| v_ArrVal_573) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| (* ~N~0 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))))))) (< ~N~0 2)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2054#(and (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (<= 1 thread1Thread1of1ForFork1_~i~0) (= (select |#valid| ~A~0.base) 1) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (* ~N~0 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))))), 56#L90true, Black: 2032#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (= (select |#valid| ~A~0.base) 1) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))), Black: 3206#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 3210#(and (= ~B~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 208#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| 1)), Black: 148#true, 865#(= (select |#valid| ~C1~0.base) 1), 1167#(= (select |#valid| ~C2~0.base) 1), Black: 1477#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (or (< ~N~0 1) (< 0 (+ ~B~0.offset 1))) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| Int)) (< (+ (* ~N~0 4) ~B~0.offset) (+ (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| (* (mod ~N~0 1073741824) 4)) ~B~0.base) 1))) (< ~N~0 1)) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_331| Int)) (< (+ (* ~N~0 4) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (+ (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_331| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1))) (< ~N~0 1)) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (or (< 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 1)) (< ~N~0 1))), 49#thread1EXITtrue, 972#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), Black: 2965#(and (<= 0 ~N~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_#res#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)))) (<= ~N~0 1073741823) (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (<= 8 (select |#length| ~A~0.base))), Black: 2953#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 727#(and (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4) (select |#length| ~A~0.base)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) (<= 0 ~A~0.offset)), Black: 1306#(and (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~C2~0.offset)) (<= 0 ~C2~0.offset) (<= 1 (mod ~N~0 1073741824)) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~C2~0.offset 4) (select |#length| ~C2~0.base)) (<= (+ ~C2~0.offset 4) (select |#length| ~C2~0.base))), 3897#(and (<= ~N~0 1073741823) (<= (* ~N~0 4) (select |#length| ~C1~0.base)) (= ~C1~0.offset 0)), Black: 859#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_314| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_313| Int)) (< 3 (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_314| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_313| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_314|))) (<= (+ ~C1~0.offset 4) (select |#length| ~C1~0.base)) (<= (+ ~C1~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~C1~0.base)) (<= 0 ~C1~0.offset) (<= 0 (+ ~C1~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))), 429#(and (<= 0 ~A~0.offset) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| (* (mod ~N~0 1073741824) 4)) ~A~0.base)))), 2957#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base))), 3016#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 2724#(and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| ~C1~0.base)) (<= (div (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 4) 1073741823) (= (mod (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 4) 0))) (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 1) (= ~C1~0.offset 0)), 695#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 ~A~0.offset)), 2652#(or (and (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (< (mod ~N~0 1073741824) 2)), 2040#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (or (and (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (or (not (= (select (store |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| v_ArrVal_571) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343|) 0)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344|) 0)))) (< 0 (+ 5 |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344|) 0)) (forall ((v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (or (not (= (select (store |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| v_ArrVal_571) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343|) 0)) (forall ((v_ArrVal_573 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| (* ~N~0 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| v_ArrVal_573) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| (* ~N~0 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))))))) (< ~N~0 2)) (= (select |#valid| ~A~0.base) 1)), Black: 3432#(and (= thread2Thread1of1ForFork2_~i~1 1) (= ~C2~0.offset 0) (<= 8 (select |#length| ~C2~0.base))), Black: 3878#(and (<= 1 ~N~0) (<= ~M~0 0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 1002#(and (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~B~0.offset)) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~B~0.offset 4) (select |#length| ~B~0.base)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), 2472#(and (or (and (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_351| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_351| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (< (mod ~N~0 1073741824) 2)) (or (< (mod ~N~0 1073741824) 2) (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| Int)) (<= (+ ~B~0.offset 8) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 (+ ~B~0.offset 4))))), Black: 3746#(and (<= 1 ~N~0) (<= ~M~0 0)), 1487#(and (<= 0 ~M~0) (= ~B~0.offset 0) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (div (select |#length| ~B~0.base) 4)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~M~0 ~N~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (* ~N~0 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork0_~i~2) (= (* ~N~0 4) (select |#length| ~B~0.base))), 57#L67true, Black: 291#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (+ (* (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 4294967296) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= (mod |ULTIMATE.start_create_fresh_uint_array_~size#1| 4294967296) 1073741823) (<= (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 0) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0)), 3876#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0)), 556#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), Black: 2480#(and (= (mod (* (select |#length| ~B~0.base) 3) 4) 0) (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (exists ((~C1~0.base Int)) (= (select |#length| ~B~0.base) (select |#length| ~C1~0.base))) (<= 2 ~N~0) (<= 8 (select |#length| ~B~0.base)) (<= 0 (+ 1073741823 (div (* (select |#length| ~B~0.base) (- 1)) 4)))), 199#(or (< (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (< ~N~0 2)), Black: 1072#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), 2064#(<= 1 ~N~0), 64#L58-6true]) [2024-11-19 09:53:34,395 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-19 09:53:34,396 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:53:34,396 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:53:34,396 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:53:34,416 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([795] L59-2-->L58-6: Formula: (let ((.cse0 (* 4 v_thread2Thread1of1ForFork2_~i~1_17))) (let ((.cse1 (+ .cse0 v_~C2~0.offset_11))) (and (<= (+ .cse0 v_~C2~0.offset_11 4) (select |v_#length_47| v_~C2~0.base_14)) (= (+ v_thread2Thread1of1ForFork2_~i~1_17 1) v_thread2Thread1of1ForFork2_~i~1_18) (= |v_#memory_int#1_35| (store |v_#memory_int#1_36| v_~C2~0.base_14 (store (select |v_#memory_int#1_36| v_~C2~0.base_14) .cse1 (+ |v_thread2Thread1of1ForFork2_#t~mem5_3| |v_thread2Thread1of1ForFork2_#t~mem4_3|)))) (= (select |v_#valid_52| v_~C2~0.base_14) 1) (<= 0 .cse1)))) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_17, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_3|, ~C2~0.offset=v_~C2~0.offset_11, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_3|, ~C2~0.base=v_~C2~0.base_14, #valid=|v_#valid_52|, #length=|v_#length_47|, #memory_int#1=|v_#memory_int#1_36|} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_18, ~C2~0.offset=v_~C2~0.offset_11, ~C2~0.base=v_~C2~0.base_14, thread2Thread1of1ForFork2_#t~post6=|v_thread2Thread1of1ForFork2_#t~post6_1|, #valid=|v_#valid_52|, #length=|v_#length_47|, #memory_int#1=|v_#memory_int#1_35|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread2Thread1of1ForFork2_#t~mem5, thread2Thread1of1ForFork2_#t~post6, #memory_int#1][72], [338#(= (select |#valid| ~A~0.base) 1), 592#(= (select |#valid| ~B~0.base) 1), Black: 2042#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (or (and (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (or (not (= (select (store |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| v_ArrVal_571) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343|) 0)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344|) 0)))) (< 0 (+ 5 |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344|) 0)) (forall ((v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (or (not (= (select (store |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| v_ArrVal_571) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343|) 0)) (forall ((v_ArrVal_573 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| (* ~N~0 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| v_ArrVal_573) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| (* ~N~0 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))))))) (< ~N~0 2)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 2054#(and (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (<= 1 thread1Thread1of1ForFork1_~i~0) (= (select |#valid| ~A~0.base) 1) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (* ~N~0 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))))), Black: 2032#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (= (select |#valid| ~A~0.base) 1) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))), Black: 3206#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 3210#(and (= ~B~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 208#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| 1)), Black: 148#true, 865#(= (select |#valid| ~C1~0.base) 1), 1167#(= (select |#valid| ~C2~0.base) 1), Black: 1477#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (or (< ~N~0 1) (< 0 (+ ~B~0.offset 1))) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| Int)) (< (+ (* ~N~0 4) ~B~0.offset) (+ (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| (* (mod ~N~0 1073741824) 4)) ~B~0.base) 1))) (< ~N~0 1)) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_331| Int)) (< (+ (* ~N~0 4) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (+ (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_331| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1))) (< ~N~0 1)) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (or (< 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 1)) (< ~N~0 1))), 972#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), Black: 2965#(and (<= 0 ~N~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_#res#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)))) (<= ~N~0 1073741823) (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (<= 8 (select |#length| ~A~0.base))), Black: 2953#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 727#(and (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4) (select |#length| ~A~0.base)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) (<= 0 ~A~0.offset)), Black: 1306#(and (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~C2~0.offset)) (<= 0 ~C2~0.offset) (<= 1 (mod ~N~0 1073741824)) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~C2~0.offset 4) (select |#length| ~C2~0.base)) (<= (+ ~C2~0.offset 4) (select |#length| ~C2~0.base))), 3897#(and (<= ~N~0 1073741823) (<= (* ~N~0 4) (select |#length| ~C1~0.base)) (= ~C1~0.offset 0)), Black: 859#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_314| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_313| Int)) (< 3 (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_314| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_313| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_314|))) (<= (+ ~C1~0.offset 4) (select |#length| ~C1~0.base)) (<= (+ ~C1~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~C1~0.base)) (<= 0 ~C1~0.offset) (<= 0 (+ ~C1~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))), 429#(and (<= 0 ~A~0.offset) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| (* (mod ~N~0 1073741824) 4)) ~A~0.base)))), 2957#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base))), 26#L90-1true, 3016#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 2724#(and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| ~C1~0.base)) (<= (div (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 4) 1073741823) (= (mod (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 4) 0))) (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 1) (= ~C1~0.offset 0)), 695#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 ~A~0.offset)), 2652#(or (and (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (< (mod ~N~0 1073741824) 2)), 2040#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (or (and (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (or (not (= (select (store |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| v_ArrVal_571) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343|) 0)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344|) 0)))) (< 0 (+ 5 |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344|) 0)) (forall ((v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (or (not (= (select (store |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| v_ArrVal_571) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343|) 0)) (forall ((v_ArrVal_573 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| (* ~N~0 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| v_ArrVal_573) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| (* ~N~0 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))))))) (< ~N~0 2)) (= (select |#valid| ~A~0.base) 1)), Black: 3432#(and (= thread2Thread1of1ForFork2_~i~1 1) (= ~C2~0.offset 0) (<= 8 (select |#length| ~C2~0.base))), Black: 3878#(and (<= 1 ~N~0) (<= ~M~0 0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 1002#(and (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~B~0.offset)) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~B~0.offset 4) (select |#length| ~B~0.base)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), 2472#(and (or (and (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_351| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_351| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (< (mod ~N~0 1073741824) 2)) (or (< (mod ~N~0 1073741824) 2) (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| Int)) (<= (+ ~B~0.offset 8) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 (+ ~B~0.offset 4))))), Black: 3746#(and (<= 1 ~N~0) (<= ~M~0 0)), 1487#(and (<= 0 ~M~0) (= ~B~0.offset 0) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (div (select |#length| ~B~0.base) 4)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~M~0 ~N~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (* ~N~0 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork0_~i~2) (= (* ~N~0 4) (select |#length| ~B~0.base))), 57#L67true, Black: 291#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (+ (* (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 4294967296) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= (mod |ULTIMATE.start_create_fresh_uint_array_~size#1| 4294967296) 1073741823) (<= (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 0) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0)), 556#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), 3876#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 2480#(and (= (mod (* (select |#length| ~B~0.base) 3) 4) 0) (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (exists ((~C1~0.base Int)) (= (select |#length| ~B~0.base) (select |#length| ~C1~0.base))) (<= 2 ~N~0) (<= 8 (select |#length| ~B~0.base)) (<= 0 (+ 1073741823 (div (* (select |#length| ~B~0.base) (- 1)) 4)))), 199#(or (< (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (< ~N~0 2)), Black: 1072#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), 2064#(<= 1 ~N~0), 64#L58-6true]) [2024-11-19 09:53:34,416 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 09:53:34,416 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:53:34,416 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:53:34,417 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:53:34,629 INFO L124 PetriNetUnfolderBase]: 2135/4047 cut-off events. [2024-11-19 09:53:34,629 INFO L125 PetriNetUnfolderBase]: For 25955/26895 co-relation queries the response was YES. [2024-11-19 09:53:34,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18840 conditions, 4047 events. 2135/4047 cut-off events. For 25955/26895 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 26152 event pairs, 1321 based on Foata normal form. 114/3717 useless extension candidates. Maximal degree in co-relation 14541. Up to 2656 conditions per place. [2024-11-19 09:53:34,680 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 85 selfloop transitions, 6 changer transitions 0/130 dead transitions. [2024-11-19 09:53:34,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 130 transitions, 1196 flow [2024-11-19 09:53:34,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:53:34,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:53:34,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 269 transitions. [2024-11-19 09:53:34,682 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5604166666666667 [2024-11-19 09:53:34,682 INFO L175 Difference]: Start difference. First operand has 158 places, 131 transitions, 1016 flow. Second operand 6 states and 269 transitions. [2024-11-19 09:53:34,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 130 transitions, 1196 flow [2024-11-19 09:53:34,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 130 transitions, 1190 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:53:34,699 INFO L231 Difference]: Finished difference. Result has 159 places, 130 transitions, 1020 flow [2024-11-19 09:53:34,699 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1008, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1020, PETRI_PLACES=159, PETRI_TRANSITIONS=130} [2024-11-19 09:53:34,700 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 80 predicate places. [2024-11-19 09:53:34,700 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 130 transitions, 1020 flow [2024-11-19 09:53:34,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.42857142857143) internal successors, (304), 7 states have internal predecessors, (304), 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) [2024-11-19 09:53:34,700 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:34,700 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:34,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 09:53:34,700 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:53:34,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:34,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1852956619, now seen corresponding path program 1 times [2024-11-19 09:53:34,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:34,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764323576] [2024-11-19 09:53:34,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:34,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:53:34,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:34,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764323576] [2024-11-19 09:53:34,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764323576] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:34,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131803402] [2024-11-19 09:53:34,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:34,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:34,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:34,798 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:34,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-19 09:53:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:34,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:53:34,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:34,981 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:53:34,981 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:35,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:53:35,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131803402] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:35,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:53:35,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2024-11-19 09:53:35,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735798680] [2024-11-19 09:53:35,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:35,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:53:35,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:35,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:53:35,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-19 09:53:35,093 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2024-11-19 09:53:35,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 130 transitions, 1020 flow. Second operand has 7 states, 7 states have (on average 47.285714285714285) internal successors, (331), 7 states have internal predecessors, (331), 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) [2024-11-19 09:53:35,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:35,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2024-11-19 09:53:35,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:35,915 INFO L124 PetriNetUnfolderBase]: 3586/6486 cut-off events. [2024-11-19 09:53:35,915 INFO L125 PetriNetUnfolderBase]: For 37566/38796 co-relation queries the response was YES. [2024-11-19 09:53:35,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30081 conditions, 6486 events. 3586/6486 cut-off events. For 37566/38796 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 43030 event pairs, 971 based on Foata normal form. 198/6272 useless extension candidates. Maximal degree in co-relation 22592. Up to 2008 conditions per place. [2024-11-19 09:53:35,996 INFO L140 encePairwiseOnDemand]: 69/80 looper letters, 141 selfloop transitions, 51 changer transitions 0/221 dead transitions. [2024-11-19 09:53:35,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 221 transitions, 2157 flow [2024-11-19 09:53:35,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:53:35,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:53:35,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 484 transitions. [2024-11-19 09:53:35,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6722222222222223 [2024-11-19 09:53:35,998 INFO L175 Difference]: Start difference. First operand has 159 places, 130 transitions, 1020 flow. Second operand 9 states and 484 transitions. [2024-11-19 09:53:35,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 221 transitions, 2157 flow [2024-11-19 09:53:36,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 221 transitions, 2145 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:53:36,193 INFO L231 Difference]: Finished difference. Result has 168 places, 151 transitions, 1407 flow [2024-11-19 09:53:36,194 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1009, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1407, PETRI_PLACES=168, PETRI_TRANSITIONS=151} [2024-11-19 09:53:36,194 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 89 predicate places. [2024-11-19 09:53:36,194 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 151 transitions, 1407 flow [2024-11-19 09:53:36,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 47.285714285714285) internal successors, (331), 7 states have internal predecessors, (331), 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) [2024-11-19 09:53:36,195 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:36,195 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:36,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-11-19 09:53:36,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:36,396 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:53:36,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:36,396 INFO L85 PathProgramCache]: Analyzing trace with hash 195600201, now seen corresponding path program 2 times [2024-11-19 09:53:36,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:36,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294318274] [2024-11-19 09:53:36,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:53:36,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:36,408 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:53:36,408 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 09:53:36,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:36,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294318274] [2024-11-19 09:53:36,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294318274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:53:36,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:53:36,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:53:36,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061383208] [2024-11-19 09:53:36,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:36,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:53:36,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:36,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:53:36,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:53:37,038 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2024-11-19 09:53:37,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 151 transitions, 1407 flow. Second operand has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 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) [2024-11-19 09:53:37,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:37,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2024-11-19 09:53:37,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:37,865 INFO L124 PetriNetUnfolderBase]: 2958/5437 cut-off events. [2024-11-19 09:53:37,865 INFO L125 PetriNetUnfolderBase]: For 52583/53897 co-relation queries the response was YES. [2024-11-19 09:53:37,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29833 conditions, 5437 events. 2958/5437 cut-off events. For 52583/53897 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 35798 event pairs, 1662 based on Foata normal form. 119/4985 useless extension candidates. Maximal degree in co-relation 22604. Up to 3749 conditions per place. [2024-11-19 09:53:37,923 INFO L140 encePairwiseOnDemand]: 76/80 looper letters, 98 selfloop transitions, 4 changer transitions 0/150 dead transitions. [2024-11-19 09:53:37,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 150 transitions, 1609 flow [2024-11-19 09:53:37,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:53:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:53:37,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 254 transitions. [2024-11-19 09:53:37,926 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.635 [2024-11-19 09:53:37,926 INFO L175 Difference]: Start difference. First operand has 168 places, 151 transitions, 1407 flow. Second operand 5 states and 254 transitions. [2024-11-19 09:53:37,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 150 transitions, 1609 flow [2024-11-19 09:53:38,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 150 transitions, 1565 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-19 09:53:38,077 INFO L231 Difference]: Finished difference. Result has 167 places, 150 transitions, 1369 flow [2024-11-19 09:53:38,077 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1361, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1369, PETRI_PLACES=167, PETRI_TRANSITIONS=150} [2024-11-19 09:53:38,078 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 88 predicate places. [2024-11-19 09:53:38,078 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 150 transitions, 1369 flow [2024-11-19 09:53:38,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.42857142857143) internal successors, (339), 7 states have internal predecessors, (339), 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) [2024-11-19 09:53:38,078 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:38,078 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:38,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-19 09:53:38,078 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:53:38,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:38,079 INFO L85 PathProgramCache]: Analyzing trace with hash -507875751, now seen corresponding path program 2 times [2024-11-19 09:53:38,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:38,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026522910] [2024-11-19 09:53:38,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:53:38,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:38,092 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:53:38,092 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 09:53:38,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:38,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026522910] [2024-11-19 09:53:38,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026522910] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:38,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386853135] [2024-11-19 09:53:38,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:53:38,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:38,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:38,236 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:38,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-19 09:53:38,330 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:53:38,330 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:38,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-19 09:53:38,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:38,346 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 [2024-11-19 09:53:38,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:53:38,393 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 09:53:38,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2024-11-19 09:53:38,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:53:38,476 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-19 09:53:38,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2024-11-19 09:53:38,488 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:53:38,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 09:53:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 09:53:38,933 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:39,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:53:39,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 174 [2024-11-19 09:53:40,675 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 09:53:40,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386853135] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:53:40,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:53:40,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2024-11-19 09:53:40,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013368032] [2024-11-19 09:53:40,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:53:40,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 09:53:40,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:40,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 09:53:40,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-11-19 09:53:43,232 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 80 [2024-11-19 09:53:43,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 150 transitions, 1369 flow. Second operand has 20 states, 20 states have (on average 40.35) internal successors, (807), 20 states have internal predecessors, (807), 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) [2024-11-19 09:53:43,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:43,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 80 [2024-11-19 09:53:43,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:44,013 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([795] L59-2-->L58-6: Formula: (let ((.cse0 (* 4 v_thread2Thread1of1ForFork2_~i~1_17))) (let ((.cse1 (+ .cse0 v_~C2~0.offset_11))) (and (<= (+ .cse0 v_~C2~0.offset_11 4) (select |v_#length_47| v_~C2~0.base_14)) (= (+ v_thread2Thread1of1ForFork2_~i~1_17 1) v_thread2Thread1of1ForFork2_~i~1_18) (= |v_#memory_int#1_35| (store |v_#memory_int#1_36| v_~C2~0.base_14 (store (select |v_#memory_int#1_36| v_~C2~0.base_14) .cse1 (+ |v_thread2Thread1of1ForFork2_#t~mem5_3| |v_thread2Thread1of1ForFork2_#t~mem4_3|)))) (= (select |v_#valid_52| v_~C2~0.base_14) 1) (<= 0 .cse1)))) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_17, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_3|, ~C2~0.offset=v_~C2~0.offset_11, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_3|, ~C2~0.base=v_~C2~0.base_14, #valid=|v_#valid_52|, #length=|v_#length_47|, #memory_int#1=|v_#memory_int#1_36|} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_18, ~C2~0.offset=v_~C2~0.offset_11, ~C2~0.base=v_~C2~0.base_14, thread2Thread1of1ForFork2_#t~post6=|v_thread2Thread1of1ForFork2_#t~post6_1|, #valid=|v_#valid_52|, #length=|v_#length_47|, #memory_int#1=|v_#memory_int#1_35|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread2Thread1of1ForFork2_#t~mem5, thread2Thread1of1ForFork2_#t~post6, #memory_int#1][142], [338#(= (select |#valid| ~A~0.base) 1), 592#(= (select |#valid| ~B~0.base) 1), Black: 2064#(<= 1 ~N~0), Black: 2042#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (or (and (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (or (not (= (select (store |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| v_ArrVal_571) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343|) 0)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344|) 0)))) (< 0 (+ 5 |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344|) 0)) (forall ((v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (or (not (= (select (store |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| v_ArrVal_571) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343|) 0)) (forall ((v_ArrVal_573 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| (* ~N~0 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| v_ArrVal_573) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| (* ~N~0 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))))))) (< ~N~0 2)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 0)), 56#L90true, Black: 2054#(and (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (<= 1 thread1Thread1of1ForFork1_~i~0) (= (select |#valid| ~A~0.base) 1) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (* ~N~0 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))))), 4144#(and (<= ~N~0 1073741823) (<= (* ~N~0 4) (select |#length| ~C2~0.base)) (= ~C2~0.offset 0)), Black: 2032#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (= (select |#valid| ~A~0.base) 1) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))), Black: 556#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), Black: 3206#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 3210#(and (= ~B~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 429#(and (<= 0 ~A~0.offset) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| (* (mod ~N~0 1073741824) 4)) ~A~0.base)))), Black: 208#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| 1)), Black: 148#true, 865#(= (select |#valid| ~C1~0.base) 1), 1167#(= (select |#valid| ~C2~0.base) 1), 2478#(and (or (and (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_351| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_351| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (< (mod ~N~0 1073741824) 2)) (<= 0 (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (or (< (mod ~N~0 1073741824) 2) (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| Int)) (<= (+ ~B~0.offset 8) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 (+ ~B~0.offset 4)))) (<= (+ ~B~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~B~0.base))), Black: 1477#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (or (< ~N~0 1) (< 0 (+ ~B~0.offset 1))) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| Int)) (< (+ (* ~N~0 4) ~B~0.offset) (+ (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| (* (mod ~N~0 1073741824) 4)) ~B~0.base) 1))) (< ~N~0 1)) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_331| Int)) (< (+ (* ~N~0 4) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (+ (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_331| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1))) (< ~N~0 1)) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (or (< 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 1)) (< ~N~0 1))), 972#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), Black: 2965#(and (<= 0 ~N~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_#res#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)))) (<= ~N~0 1073741823) (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (<= 8 (select |#length| ~A~0.base))), Black: 2953#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 727#(and (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4) (select |#length| ~A~0.base)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) (<= 0 ~A~0.offset)), Black: 1306#(and (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~C2~0.offset)) (<= 0 ~C2~0.offset) (<= 1 (mod ~N~0 1073741824)) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~C2~0.offset 4) (select |#length| ~C2~0.base)) (<= (+ ~C2~0.offset 4) (select |#length| ~C2~0.base))), Black: 3904#(<= 1 ~N~0), 2957#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base))), Black: 4128#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), Black: 4122#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 3016#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), 59#L51-2true, Black: 2724#(and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| ~C1~0.base)) (<= (div (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 4) 1073741823) (= (mod (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 4) 0))) (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 1) (= ~C1~0.offset 0)), Black: 4120#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 695#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 ~A~0.offset)), 2652#(or (and (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (< (mod ~N~0 1073741824) 2)), Black: 3432#(and (= thread2Thread1of1ForFork2_~i~1 1) (= ~C2~0.offset 0) (<= 8 (select |#length| ~C2~0.base))), Black: 3878#(and (<= 1 ~N~0) (<= ~M~0 0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 1002#(and (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~B~0.offset)) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~B~0.offset 4) (select |#length| ~B~0.base)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), Black: 3746#(and (<= 1 ~N~0) (<= ~M~0 0)), 1487#(and (<= 0 ~M~0) (= ~B~0.offset 0) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (div (select |#length| ~B~0.base) 4)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~M~0 ~N~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (* ~N~0 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork0_~i~2) (= (* ~N~0 4) (select |#length| ~B~0.base))), 57#L67true, 4384#(and (= (select |#length| ~B~0.base) (select |#length| ~C1~0.base)) (= ~A~0.offset 0) (= 0 (mod (select |#length| ~C1~0.base) 4)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (not (= ~C1~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| ~C1~0.base)))) (<= 0 ~B~0.offset) (<= (* ~N~0 4) (select |#length| ~C1~0.base)) (<= 0 thread1Thread1of1ForFork1_~i~0) (exists ((v_subst_25 Int)) (= (select |#length| ~C1~0.base) (select |#length| v_subst_25))) (= ~C1~0.offset 0) (<= (div (select |#length| ~C1~0.base) 4) 1073741823) (<= (+ 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~C1~0.base))), Black: 291#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (+ (* (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 4294967296) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= (mod |ULTIMATE.start_create_fresh_uint_array_~size#1| 4294967296) 1073741823) (<= (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 0) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0)), 4124#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0)), 3876#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 2480#(and (= (mod (* (select |#length| ~B~0.base) 3) 4) 0) (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (exists ((~C1~0.base Int)) (= (select |#length| ~B~0.base) (select |#length| ~C1~0.base))) (<= 2 ~N~0) (<= 8 (select |#length| ~B~0.base)) (<= 0 (+ 1073741823 (div (* (select |#length| ~B~0.base) (- 1)) 4)))), 199#(or (< (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (< ~N~0 2)), Black: 1072#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), Black: 2472#(and (or (and (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_351| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_351| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (< (mod ~N~0 1073741824) 2)) (or (< (mod ~N~0 1073741824) 2) (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| Int)) (<= (+ ~B~0.offset 8) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 (+ ~B~0.offset 4))))), 64#L58-6true]) [2024-11-19 09:53:44,013 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:53:44,013 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:53:44,013 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:53:44,013 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:53:44,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([795] L59-2-->L58-6: Formula: (let ((.cse0 (* 4 v_thread2Thread1of1ForFork2_~i~1_17))) (let ((.cse1 (+ .cse0 v_~C2~0.offset_11))) (and (<= (+ .cse0 v_~C2~0.offset_11 4) (select |v_#length_47| v_~C2~0.base_14)) (= (+ v_thread2Thread1of1ForFork2_~i~1_17 1) v_thread2Thread1of1ForFork2_~i~1_18) (= |v_#memory_int#1_35| (store |v_#memory_int#1_36| v_~C2~0.base_14 (store (select |v_#memory_int#1_36| v_~C2~0.base_14) .cse1 (+ |v_thread2Thread1of1ForFork2_#t~mem5_3| |v_thread2Thread1of1ForFork2_#t~mem4_3|)))) (= (select |v_#valid_52| v_~C2~0.base_14) 1) (<= 0 .cse1)))) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_17, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_3|, ~C2~0.offset=v_~C2~0.offset_11, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_3|, ~C2~0.base=v_~C2~0.base_14, #valid=|v_#valid_52|, #length=|v_#length_47|, #memory_int#1=|v_#memory_int#1_36|} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_18, ~C2~0.offset=v_~C2~0.offset_11, ~C2~0.base=v_~C2~0.base_14, thread2Thread1of1ForFork2_#t~post6=|v_thread2Thread1of1ForFork2_#t~post6_1|, #valid=|v_#valid_52|, #length=|v_#length_47|, #memory_int#1=|v_#memory_int#1_35|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, thread2Thread1of1ForFork2_#t~mem5, thread2Thread1of1ForFork2_#t~post6, #memory_int#1][130], [338#(= (select |#valid| ~A~0.base) 1), 592#(= (select |#valid| ~B~0.base) 1), 4382#(and (= (select |#length| ~B~0.base) (select |#length| ~C1~0.base)) (= ~A~0.offset 0) (= 0 (mod (select |#length| ~C1~0.base) 4)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (not (= ~C1~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| ~C1~0.base)))) (<= 0 (div (select |#length| ~C1~0.base) 4)) (<= 0 ~B~0.offset) (<= (* ~N~0 4) (select |#length| ~C1~0.base)) (<= 0 thread1Thread1of1ForFork1_~i~0) (= ~C1~0.offset 0) (<= (div (select |#length| ~C1~0.base) 4) 1073741823)), Black: 2042#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (or (and (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (or (not (= (select (store |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| v_ArrVal_571) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343|) 0)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344|) 0)))) (< 0 (+ 5 |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344|) 0)) (forall ((v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (or (not (= (select (store |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| v_ArrVal_571) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343|) 0)) (forall ((v_ArrVal_573 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| (* ~N~0 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| v_ArrVal_573) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| (* ~N~0 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))))))) (< ~N~0 2)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 0)), 56#L90true, Black: 2054#(and (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (<= 1 thread1Thread1of1ForFork1_~i~0) (= (select |#valid| ~A~0.base) 1) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (* ~N~0 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))))), 4144#(and (<= ~N~0 1073741823) (<= (* ~N~0 4) (select |#length| ~C2~0.base)) (= ~C2~0.offset 0)), Black: 2032#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (= (select |#valid| ~A~0.base) 1) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))), Black: 3206#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 3210#(and (= ~B~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 208#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| 1)), Black: 148#true, 865#(= (select |#valid| ~C1~0.base) 1), 1167#(= (select |#valid| ~C2~0.base) 1), Black: 1477#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (or (< ~N~0 1) (< 0 (+ ~B~0.offset 1))) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| Int)) (< (+ (* ~N~0 4) ~B~0.offset) (+ (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| (* (mod ~N~0 1073741824) 4)) ~B~0.base) 1))) (< ~N~0 1)) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_331| Int)) (< (+ (* ~N~0 4) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (+ (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_331| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1))) (< ~N~0 1)) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (or (< 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 1)) (< ~N~0 1))), 972#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), Black: 2965#(and (<= 0 ~N~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_#res#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)))) (<= ~N~0 1073741823) (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (<= 8 (select |#length| ~A~0.base))), Black: 2953#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 727#(and (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset 4) (select |#length| ~A~0.base)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) (<= 0 ~A~0.offset)), Black: 1306#(and (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~C2~0.offset)) (<= 0 ~C2~0.offset) (<= 1 (mod ~N~0 1073741824)) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~C2~0.offset 4) (select |#length| ~C2~0.base)) (<= (+ ~C2~0.offset 4) (select |#length| ~C2~0.base))), Black: 859#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_314| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_313| Int)) (< 3 (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_314| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_313| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_314|))) (<= (+ ~C1~0.offset 4) (select |#length| ~C1~0.base)) (<= (+ ~C1~0.offset 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~C1~0.base)) (<= 0 ~C1~0.offset) (<= 0 (+ ~C1~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))), 429#(and (<= 0 ~A~0.offset) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| (* (mod ~N~0 1073741824) 4)) ~A~0.base)))), Black: 3904#(<= 1 ~N~0), 2957#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base))), Black: 4128#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), Black: 4122#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 3016#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 2724#(and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| ~C1~0.base)) (<= (div (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 4) 1073741823) (= (mod (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 4) 0))) (<= 2 ~N~0) (= thread1Thread1of1ForFork1_~i~0 1) (= ~C1~0.offset 0)), Black: 4120#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 695#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 ~A~0.offset)), 1072#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1)), 2652#(or (and (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (< (mod ~N~0 1073741824) 2)), 70#L50-6true, Black: 3432#(and (= thread2Thread1of1ForFork2_~i~1 1) (= ~C2~0.offset 0) (<= 8 (select |#length| ~C2~0.base))), Black: 3878#(and (<= 1 ~N~0) (<= ~M~0 0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 1002#(and (<= 0 (+ (* thread2Thread1of1ForFork2_~i~1 4) ~B~0.offset)) (<= (+ (* thread2Thread1of1ForFork2_~i~1 4) ~B~0.offset 4) (select |#length| ~B~0.base)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), 2472#(and (or (and (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_351| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_351| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (< (mod ~N~0 1073741824) 2)) (or (< (mod ~N~0 1073741824) 2) (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| Int)) (<= (+ ~B~0.offset 8) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 (+ ~B~0.offset 4))))), Black: 3746#(and (<= 1 ~N~0) (<= ~M~0 0)), 1487#(and (<= 0 ~M~0) (= ~B~0.offset 0) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (div (select |#length| ~B~0.base) 4)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~M~0 ~N~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (* ~N~0 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork0_~i~2) (= (* ~N~0 4) (select |#length| ~B~0.base))), 57#L67true, Black: 291#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (+ (* (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 4294967296) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= (mod |ULTIMATE.start_create_fresh_uint_array_~size#1| 4294967296) 1073741823) (<= (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 0) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0)), 4124#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0)), 556#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), 3876#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 2480#(and (= (mod (* (select |#length| ~B~0.base) 3) 4) 0) (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (exists ((~C1~0.base Int)) (= (select |#length| ~B~0.base) (select |#length| ~C1~0.base))) (<= 2 ~N~0) (<= 8 (select |#length| ~B~0.base)) (<= 0 (+ 1073741823 (div (* (select |#length| ~B~0.base) (- 1)) 4)))), 199#(or (< (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (< ~N~0 2)), 2064#(<= 1 ~N~0), 64#L58-6true]) [2024-11-19 09:53:44,034 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:53:44,034 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:53:44,034 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:53:44,034 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:53:44,680 INFO L124 PetriNetUnfolderBase]: 5684/8932 cut-off events. [2024-11-19 09:53:44,681 INFO L125 PetriNetUnfolderBase]: For 84392/86841 co-relation queries the response was YES. [2024-11-19 09:53:44,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48893 conditions, 8932 events. 5684/8932 cut-off events. For 84392/86841 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 52793 event pairs, 788 based on Foata normal form. 514/8959 useless extension candidates. Maximal degree in co-relation 36858. Up to 4267 conditions per place. [2024-11-19 09:53:44,756 INFO L140 encePairwiseOnDemand]: 70/80 looper letters, 192 selfloop transitions, 21 changer transitions 0/249 dead transitions. [2024-11-19 09:53:44,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 249 transitions, 2983 flow [2024-11-19 09:53:44,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:53:44,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:53:44,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 392 transitions. [2024-11-19 09:53:44,758 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5444444444444444 [2024-11-19 09:53:44,758 INFO L175 Difference]: Start difference. First operand has 167 places, 150 transitions, 1369 flow. Second operand 9 states and 392 transitions. [2024-11-19 09:53:44,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 249 transitions, 2983 flow [2024-11-19 09:53:44,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 249 transitions, 2968 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-19 09:53:44,831 INFO L231 Difference]: Finished difference. Result has 169 places, 149 transitions, 1390 flow [2024-11-19 09:53:44,831 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1390, PETRI_PLACES=169, PETRI_TRANSITIONS=149} [2024-11-19 09:53:44,831 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 90 predicate places. [2024-11-19 09:53:44,831 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 149 transitions, 1390 flow [2024-11-19 09:53:44,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 40.35) internal successors, (807), 20 states have internal predecessors, (807), 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) [2024-11-19 09:53:44,832 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:44,832 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:44,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-19 09:53:45,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-19 09:53:45,032 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:53:45,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:45,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1838166247, now seen corresponding path program 1 times [2024-11-19 09:53:45,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:45,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045053262] [2024-11-19 09:53:45,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:45,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 09:53:45,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:45,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045053262] [2024-11-19 09:53:45,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045053262] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:45,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952577246] [2024-11-19 09:53:45,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:45,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:45,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:45,132 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:45,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-19 09:53:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:45,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:53:45,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:45,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 09:53:45,310 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:45,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 09:53:45,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952577246] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:45,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:53:45,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2024-11-19 09:53:45,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381585435] [2024-11-19 09:53:45,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:45,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:53:45,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:45,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:53:45,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-19 09:53:45,443 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2024-11-19 09:53:45,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 149 transitions, 1390 flow. Second operand has 7 states, 7 states have (on average 47.42857142857143) internal successors, (332), 7 states have internal predecessors, (332), 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) [2024-11-19 09:53:45,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:45,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2024-11-19 09:53:45,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:45,912 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([799] L67-->L67-1: Formula: (let ((.cse0 (* v_thread3Thread1of1ForFork0_~i~2_7 4))) (let ((.cse1 (+ v_~A~0.offset_5 .cse0))) (and (<= (+ v_~A~0.offset_5 .cse0 4) (select |v_#length_13| v_~A~0.base_7)) (= (select |v_#valid_13| v_~A~0.base_7) 1) (= |v_thread3Thread1of1ForFork0_#t~mem7_1| (select (select |v_#memory_int#1_9| v_~A~0.base_7) .cse1)) (<= 0 .cse1)))) InVars {~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_5, #valid=|v_#valid_13|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #length=|v_#length_13|, #memory_int#1=|v_#memory_int#1_9|} OutVars{~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_5, #valid=|v_#valid_13|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #length=|v_#length_13|, #memory_int#1=|v_#memory_int#1_9|, thread3Thread1of1ForFork0_#t~mem7=|v_thread3Thread1of1ForFork0_#t~mem7_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem7][74], [338#(= (select |#valid| ~A~0.base) 1), 592#(= (select |#valid| ~B~0.base) 1), Black: 2064#(<= 1 ~N~0), 4615#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 2042#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (or (and (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (or (not (= (select (store |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| v_ArrVal_571) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343|) 0)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344|) 0)))) (< 0 (+ 5 |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344|) 0)) (forall ((v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (or (not (= (select (store |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| v_ArrVal_571) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343|) 0)) (forall ((v_ArrVal_573 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| (* ~N~0 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| v_ArrVal_573) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| (* ~N~0 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))))))) (< ~N~0 2)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 0)), 47#L89-4true, Black: 2054#(and (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (<= 1 thread1Thread1of1ForFork1_~i~0) (= (select |#valid| ~A~0.base) 1) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (* ~N~0 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))))), Black: 2032#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (= (select |#valid| ~A~0.base) 1) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))), Black: 556#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), 54#L59-1true, Black: 3206#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 3210#(and (= ~B~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 429#(and (<= 0 ~A~0.offset) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| (* (mod ~N~0 1073741824) 4)) ~A~0.base)))), 3880#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 208#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| 1)), Black: 148#true, 865#(= (select |#valid| ~C1~0.base) 1), 1167#(= (select |#valid| ~C2~0.base) 1), Black: 1477#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (or (< ~N~0 1) (< 0 (+ ~B~0.offset 1))) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| Int)) (< (+ (* ~N~0 4) ~B~0.offset) (+ (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| (* (mod ~N~0 1073741824) 4)) ~B~0.base) 1))) (< ~N~0 1)) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_331| Int)) (< (+ (* ~N~0 4) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (+ (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_331| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1))) (< ~N~0 1)) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (or (< 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 1)) (< ~N~0 1))), Black: 2965#(and (<= 0 ~N~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_#res#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)))) (<= ~N~0 1073741823) (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (<= 8 (select |#length| ~A~0.base))), Black: 695#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 ~A~0.offset)), Black: 2953#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (= thread2Thread1of1ForFork2_~i~1 0)), 72#L51-1true, Black: 3904#(<= 1 ~N~0), 2955#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (= thread2Thread1of1ForFork2_~i~1 0) (<= 4 (select |#length| ~A~0.base))), Black: 4124#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 4128#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), Black: 4122#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 3016#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 4120#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 2652#(or (and (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (< (mod ~N~0 1073741824) 2)), Black: 3432#(and (= thread2Thread1of1ForFork2_~i~1 1) (= ~C2~0.offset 0) (<= 8 (select |#length| ~C2~0.base))), Black: 3878#(and (<= 1 ~N~0) (<= ~M~0 0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 972#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), Black: 3746#(and (<= 1 ~N~0) (<= ~M~0 0)), 2472#(and (or (and (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_351| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_351| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (< (mod ~N~0 1073741824) 2)) (or (< (mod ~N~0 1073741824) 2) (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| Int)) (<= (+ ~B~0.offset 8) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 (+ ~B~0.offset 4))))), 1487#(and (<= 0 ~M~0) (= ~B~0.offset 0) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (div (select |#length| ~B~0.base) 4)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~M~0 ~N~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (* ~N~0 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork0_~i~2) (= (* ~N~0 4) (select |#length| ~B~0.base))), 4384#(and (= (select |#length| ~B~0.base) (select |#length| ~C1~0.base)) (= ~A~0.offset 0) (= 0 (mod (select |#length| ~C1~0.base) 4)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (not (= ~C1~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| ~C1~0.base)))) (<= 0 ~B~0.offset) (<= (* ~N~0 4) (select |#length| ~C1~0.base)) (<= 0 thread1Thread1of1ForFork1_~i~0) (exists ((v_subst_25 Int)) (= (select |#length| ~C1~0.base) (select |#length| v_subst_25))) (= ~C1~0.offset 0) (<= (div (select |#length| ~C1~0.base) 4) 1073741823) (<= (+ 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~C1~0.base))), 40#L67-1true, Black: 291#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (+ (* (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 4294967296) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= (mod |ULTIMATE.start_create_fresh_uint_array_~size#1| 4294967296) 1073741823) (<= (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 0) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0)), Black: 1652#(and (<= ~M~0 1) (<= 0 ~M~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1)), Black: 2480#(and (= (mod (* (select |#length| ~B~0.base) 3) 4) 0) (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (exists ((~C1~0.base Int)) (= (select |#length| ~B~0.base) (select |#length| ~C1~0.base))) (<= 2 ~N~0) (<= 8 (select |#length| ~B~0.base)) (<= 0 (+ 1073741823 (div (* (select |#length| ~B~0.base) (- 1)) 4)))), 199#(or (< (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (< ~N~0 2)), Black: 1072#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1))]) [2024-11-19 09:53:45,913 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:53:45,913 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:53:45,913 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:53:45,913 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:53:45,940 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([799] L67-->L67-1: Formula: (let ((.cse0 (* v_thread3Thread1of1ForFork0_~i~2_7 4))) (let ((.cse1 (+ v_~A~0.offset_5 .cse0))) (and (<= (+ v_~A~0.offset_5 .cse0 4) (select |v_#length_13| v_~A~0.base_7)) (= (select |v_#valid_13| v_~A~0.base_7) 1) (= |v_thread3Thread1of1ForFork0_#t~mem7_1| (select (select |v_#memory_int#1_9| v_~A~0.base_7) .cse1)) (<= 0 .cse1)))) InVars {~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_5, #valid=|v_#valid_13|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #length=|v_#length_13|, #memory_int#1=|v_#memory_int#1_9|} OutVars{~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_5, #valid=|v_#valid_13|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_7, #length=|v_#length_13|, #memory_int#1=|v_#memory_int#1_9|, thread3Thread1of1ForFork0_#t~mem7=|v_thread3Thread1of1ForFork0_#t~mem7_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem7][74], [338#(= (select |#valid| ~A~0.base) 1), 592#(= (select |#valid| ~B~0.base) 1), Black: 2064#(<= 1 ~N~0), Black: 2042#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (or (and (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| Int) (v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (or (not (= (select (store |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| v_ArrVal_571) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343|) 0)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344|) 0)))) (< 0 (+ 5 |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344|) 0)) (forall ((v_ArrVal_571 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| Int)) (or (not (= (select (store |#valid| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| v_ArrVal_571) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343|) 0)) (forall ((v_ArrVal_573 Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_344| (* ~N~0 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_343| v_ArrVal_573) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_342| (* ~N~0 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))))))) (< ~N~0 2)) (= (select |#valid| ~A~0.base) 1) (= thread1Thread1of1ForFork1_~i~0 0)), 4615#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 2054#(and (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (<= 1 thread1Thread1of1ForFork1_~i~0) (= (select |#valid| ~A~0.base) 1) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (* ~N~0 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))))), 56#L90true, Black: 2032#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= (* ~N~0 4) (select |#length| ~A~0.base)) (= ~A~0.offset 0) (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (= (select |#valid| ~A~0.base) 1) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))), Black: 556#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_302| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), 54#L59-1true, Black: 3206#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 3210#(and (= ~B~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 1) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_362|)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 429#(and (<= 0 ~A~0.offset) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_297| (* (mod ~N~0 1073741824) 4)) ~A~0.base)))), 3880#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 208#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| 1)), Black: 148#true, 865#(= (select |#valid| ~C1~0.base) 1), 1167#(= (select |#valid| ~C2~0.base) 1), Black: 1477#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (or (< ~N~0 1) (< 0 (+ ~B~0.offset 1))) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| Int)) (< (+ (* ~N~0 4) ~B~0.offset) (+ (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| (* (mod ~N~0 1073741824) 4)) ~B~0.base) 1))) (< ~N~0 1)) (or (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_331| Int)) (< (+ (* ~N~0 4) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (+ (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_331| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_330| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1))) (< ~N~0 1)) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (or (< 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 1)) (< ~N~0 1))), Black: 2965#(and (<= 0 ~N~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_#res#1.base| Int)) (and (<= 8 (select |#length| |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (not (= ~A~0.base |ULTIMATE.start_create_fresh_uint_array_#res#1.base|)))) (<= ~N~0 1073741823) (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (<= 1 thread2Thread1of1ForFork2_~i~1) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (<= 8 (select |#length| ~A~0.base))), Black: 695#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| Int)) (<= (+ ~A~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_308| (* (mod ~N~0 1073741824) 4)) ~A~0.base))) (<= 0 ~A~0.offset)), Black: 2953#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (= thread2Thread1of1ForFork2_~i~1 0)), 72#L51-1true, Black: 3904#(<= 1 ~N~0), 2955#(and (<= 0 ~N~0) (<= ~N~0 1073741823) (= ~A~0.offset 0) (<= (* ~M~0 4) (select |#length| ~A~0.base)) (= (select |#valid| ~A~0.base) 1) (<= (* ~N~0 4) (select |#length| ~A~0.base)) (= thread2Thread1of1ForFork2_~i~1 0) (<= 4 (select |#length| ~A~0.base))), Black: 4124#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= 1 ~N~0)), Black: 4128#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0)), Black: 4122#(and (or (< thread2Thread1of1ForFork2_~i~1 ~M~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)) (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 3016#(and (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (* (mod ~N~0 1073741824) 4))) (= (select |#length| ~B~0.base) (* (mod ~N~0 1073741824) 4))), Black: 4120#(and (<= 1 ~N~0) (<= (+ thread2Thread1of1ForFork2_~i~1 1) ~N~0)), 2652#(or (and (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_354| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (< (mod ~N~0 1073741824) 2)), Black: 3432#(and (= thread2Thread1of1ForFork2_~i~1 1) (= ~C2~0.offset 0) (<= 8 (select |#length| ~C2~0.base))), Black: 3878#(and (<= 1 ~N~0) (<= ~M~0 0) (<= thread3Thread1of1ForFork0_~i~2 0)), Black: 972#(and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| Int)) (<= (+ ~B~0.offset 4) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_318| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 ~B~0.offset)), Black: 3746#(and (<= 1 ~N~0) (<= ~M~0 0)), 2472#(and (or (and (<= 0 (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_351| Int) (|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| Int)) (<= (+ |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 8) (select (store (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_351| (* (mod ~N~0 1073741824) 4)) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| (* (mod ~N~0 1073741824) 4)) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (< (mod ~N~0 1073741824) 2)) (or (< (mod ~N~0 1073741824) 2) (and (forall ((|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| Int)) (<= (+ ~B~0.offset 8) (select (store |#length| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_350| (* (mod ~N~0 1073741824) 4)) ~B~0.base))) (<= 0 (+ ~B~0.offset 4))))), 1487#(and (<= 0 ~M~0) (= ~B~0.offset 0) (<= (+ thread3Thread1of1ForFork0_~i~2 1) (div (select |#length| ~B~0.base) 4)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~M~0 ~N~0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (* ~N~0 4) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork0_~i~2) (= (* ~N~0 4) (select |#length| ~B~0.base))), 4384#(and (= (select |#length| ~B~0.base) (select |#length| ~C1~0.base)) (= ~A~0.offset 0) (= 0 (mod (select |#length| ~C1~0.base) 4)) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (and (not (= ~C1~0.base |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (select |#length| ~C1~0.base)))) (<= 0 ~B~0.offset) (<= (* ~N~0 4) (select |#length| ~C1~0.base)) (<= 0 thread1Thread1of1ForFork1_~i~0) (exists ((v_subst_25 Int)) (= (select |#length| ~C1~0.base) (select |#length| v_subst_25))) (= ~C1~0.offset 0) (<= (div (select |#length| ~C1~0.base) 4) 1073741823) (<= (+ 4 (* thread1Thread1of1ForFork1_~i~0 4)) (select |#length| ~C1~0.base))), 40#L67-1true, Black: 291#(and (= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= (* |ULTIMATE.start_create_fresh_uint_array_~size#1| 4) (+ (* (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 4294967296) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= (mod |ULTIMATE.start_create_fresh_uint_array_~size#1| 4294967296) 1073741823) (<= (div |ULTIMATE.start_create_fresh_uint_array_~size#1| 1073741824) 0) (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0)), Black: 1652#(and (<= ~M~0 1) (<= 0 ~M~0) (<= 1 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 1)), Black: 2480#(and (= (mod (* (select |#length| ~B~0.base) 3) 4) 0) (= ~B~0.offset 0) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| Int)) (= (select |#length| ~B~0.base) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (exists ((~C1~0.base Int)) (= (select |#length| ~B~0.base) (select |#length| ~C1~0.base))) (<= 2 ~N~0) (<= 8 (select |#length| ~B~0.base)) (<= 0 (+ 1073741823 (div (* (select |#length| ~B~0.base) (- 1)) 4)))), 199#(or (< (+ |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_uint_array_~size#1|) (< ~N~0 2)), Black: 1072#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~N~0 1))]) [2024-11-19 09:53:45,940 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-19 09:53:45,940 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:53:45,940 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:53:45,941 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:53:46,507 INFO L124 PetriNetUnfolderBase]: 4736/8428 cut-off events. [2024-11-19 09:53:46,507 INFO L125 PetriNetUnfolderBase]: For 67826/69538 co-relation queries the response was YES. [2024-11-19 09:53:46,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45656 conditions, 8428 events. 4736/8428 cut-off events. For 67826/69538 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 57949 event pairs, 1243 based on Foata normal form. 238/8226 useless extension candidates. Maximal degree in co-relation 31850. Up to 2436 conditions per place. [2024-11-19 09:53:46,618 INFO L140 encePairwiseOnDemand]: 69/80 looper letters, 153 selfloop transitions, 64 changer transitions 0/244 dead transitions. [2024-11-19 09:53:46,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 244 transitions, 2774 flow [2024-11-19 09:53:46,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:53:46,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:53:46,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 431 transitions. [2024-11-19 09:53:46,619 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6734375 [2024-11-19 09:53:46,619 INFO L175 Difference]: Start difference. First operand has 169 places, 149 transitions, 1390 flow. Second operand 8 states and 431 transitions. [2024-11-19 09:53:46,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 244 transitions, 2774 flow [2024-11-19 09:53:46,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 244 transitions, 2668 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-19 09:53:46,726 INFO L231 Difference]: Finished difference. Result has 172 places, 179 transitions, 1973 flow [2024-11-19 09:53:46,727 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1973, PETRI_PLACES=172, PETRI_TRANSITIONS=179} [2024-11-19 09:53:46,727 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 93 predicate places. [2024-11-19 09:53:46,727 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 179 transitions, 1973 flow [2024-11-19 09:53:46,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 47.42857142857143) internal successors, (332), 7 states have internal predecessors, (332), 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) [2024-11-19 09:53:46,727 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:46,728 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:46,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-19 09:53:46,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-19 09:53:46,932 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:53:46,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:46,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1667578511, now seen corresponding path program 2 times [2024-11-19 09:53:46,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:46,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92345958] [2024-11-19 09:53:46,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:53:46,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:46,957 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:53:46,958 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 09:53:47,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:47,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92345958] [2024-11-19 09:53:47,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92345958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:53:47,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:53:47,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:53:47,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040666680] [2024-11-19 09:53:47,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:47,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:53:47,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:47,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:53:47,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:53:47,110 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2024-11-19 09:53:47,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 179 transitions, 1973 flow. Second operand has 6 states, 6 states have (on average 48.166666666666664) internal successors, (289), 6 states have internal predecessors, (289), 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) [2024-11-19 09:53:47,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:47,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2024-11-19 09:53:47,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:48,601 INFO L124 PetriNetUnfolderBase]: 5230/9210 cut-off events. [2024-11-19 09:53:48,602 INFO L125 PetriNetUnfolderBase]: For 83774/85713 co-relation queries the response was YES. [2024-11-19 09:53:48,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53066 conditions, 9210 events. 5230/9210 cut-off events. For 83774/85713 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 63896 event pairs, 2017 based on Foata normal form. 261/8913 useless extension candidates. Maximal degree in co-relation 38373. Up to 4501 conditions per place. [2024-11-19 09:53:48,762 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 161 selfloop transitions, 47 changer transitions 15/250 dead transitions. [2024-11-19 09:53:48,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 250 transitions, 3194 flow [2024-11-19 09:53:48,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:53:48,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:53:48,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 334 transitions. [2024-11-19 09:53:48,764 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6958333333333333 [2024-11-19 09:53:48,764 INFO L175 Difference]: Start difference. First operand has 172 places, 179 transitions, 1973 flow. Second operand 6 states and 334 transitions. [2024-11-19 09:53:48,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 250 transitions, 3194 flow [2024-11-19 09:53:49,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 250 transitions, 3138 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-11-19 09:53:49,008 INFO L231 Difference]: Finished difference. Result has 176 places, 194 transitions, 2303 flow [2024-11-19 09:53:49,009 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1925, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2303, PETRI_PLACES=176, PETRI_TRANSITIONS=194} [2024-11-19 09:53:49,010 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 97 predicate places. [2024-11-19 09:53:49,010 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 194 transitions, 2303 flow [2024-11-19 09:53:49,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.166666666666664) internal successors, (289), 6 states have internal predecessors, (289), 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) [2024-11-19 09:53:49,010 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:49,010 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:49,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-19 09:53:49,011 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2024-11-19 09:53:49,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:49,011 INFO L85 PathProgramCache]: Analyzing trace with hash 324838549, now seen corresponding path program 3 times [2024-11-19 09:53:49,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:49,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325907978] [2024-11-19 09:53:49,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:53:49,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:49,034 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 09:53:49,035 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:49,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:53:49,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:49,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325907978] [2024-11-19 09:53:49,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325907978] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:49,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764070265] [2024-11-19 09:53:49,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:53:49,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:49,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:49,159 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:49,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-19 09:53:49,317 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 09:53:49,317 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:49,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:53:49,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:49,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 09:53:49,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:53:49,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764070265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:53:49,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 09:53:49,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-11-19 09:53:49,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388033650] [2024-11-19 09:53:49,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:49,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:53:49,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:49,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:53:49,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:53:49,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2024-11-19 09:53:49,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 194 transitions, 2303 flow. Second operand has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 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) [2024-11-19 09:53:49,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:49,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2024-11-19 09:53:49,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand